TY - GEN
T1 - Polynomial models of discrete time series over finite fields
AU - Li, Aihua
PY - 2003
Y1 - 2003
N2 - A discrete time series over a field F, With π state sets and m time steps, can be described by a function f = (f1,...,fn): Fn →Fn, When F Is a finite field, it is well known that each coordinate function fi is a polynomial in π variables over F. Thus a discrete time series over F can be modeled by a set of polynomials over F. This paper studies the commutative algebra methods to construct a desired polynomial model. Applications of Gröbner Bases techniques in the modeling process were discussed.
AB - A discrete time series over a field F, With π state sets and m time steps, can be described by a function f = (f1,...,fn): Fn →Fn, When F Is a finite field, it is well known that each coordinate function fi is a polynomial in π variables over F. Thus a discrete time series over F can be modeled by a set of polynomials over F. This paper studies the commutative algebra methods to construct a desired polynomial model. Applications of Gröbner Bases techniques in the modeling process were discussed.
UR - http://www.scopus.com/inward/record.url?scp=29244447096&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:29244447096
SN - 1890888001
T3 - Proceedings of Dynamic Systems and Applications
SP - 68
EP - 73
BT - Proceedings of Dynamic Systems and Applications - 4th International Conference on Dynamic Systems and Applications
A2 - Ladde, G.S.
A2 - Medhin, N.G.
A2 - Sambandham, M.
T2 - Proceedings of the 4th International Conference on Dynamic Systems and Applications
Y2 - 21 May 2003 through 24 May 2003
ER -