Polynomial models of discrete time series over finite fields

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of Dynamic Systems and Applications - 4th International Conference on Dynamic Systems and Applications
EditorsG.S. Ladde, N.G. Medhin, M. Sambandham
Pages68-73
Number of pages6
StatePublished - 1 Dec 2003
EventProceedings of the 4th International Conference on Dynamic Systems and Applications - Atlanta, GA, United States
Duration: 21 May 200324 May 2003

Publication series

NameProceedings of Dynamic Systems and Applications

Other

OtherProceedings of the 4th International Conference on Dynamic Systems and Applications
CountryUnited States
CityAtlanta, GA
Period21/05/0324/05/03

Fingerprint Dive into the research topics of 'Polynomial models of discrete time series over finite fields'. Together they form a unique fingerprint.

Cite this