Polynomial models of discrete time series over finite fields

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-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

Other

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

Fingerprint

Time series
Polynomials
Algebra
Statistical Models

Cite this

Li, A. (2003). Polynomial models of discrete time series over finite fields. In G. S. Ladde, N. G. Medhin, & M. Sambandham (Eds.), Proceedings of Dynamic Systems and Applications - 4th International Conference on Dynamic Systems and Applications (pp. 68-73)
Li, Aihua. / Polynomial models of discrete time series over finite fields. Proceedings of Dynamic Systems and Applications - 4th International Conference on Dynamic Systems and Applications. editor / G.S. Ladde ; N.G. Medhin ; M. Sambandham. 2003. pp. 68-73
@inproceedings{0e72b5706f6949eba653dde0625a76d5,
title = "Polynomial models of discrete time series over finite fields",
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{\"o}bner Bases techniques in the modeling process were discussed.",
author = "Aihua Li",
year = "2003",
month = "12",
day = "1",
language = "English",
isbn = "1890888001",
pages = "68--73",
editor = "G.S. Ladde and N.G. Medhin and M. Sambandham",
booktitle = "Proceedings of Dynamic Systems and Applications - 4th International Conference on Dynamic Systems and Applications",

}

Li, A 2003, Polynomial models of discrete time series over finite fields. in GS Ladde, NG Medhin & M Sambandham (eds), Proceedings of Dynamic Systems and Applications - 4th International Conference on Dynamic Systems and Applications. pp. 68-73, Proceedings of the 4th International Conference on Dynamic Systems and Applications, Atlanta, GA, United States, 21/05/03.

Polynomial models of discrete time series over finite fields. / Li, Aihua.

Proceedings of Dynamic Systems and Applications - 4th International Conference on Dynamic Systems and Applications. ed. / G.S. Ladde; N.G. Medhin; M. Sambandham. 2003. p. 68-73.

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

TY - GEN

T1 - Polynomial models of discrete time series over finite fields

AU - Li, Aihua

PY - 2003/12/1

Y1 - 2003/12/1

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

SN - 1890888001

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.

ER -

Li A. Polynomial models of discrete time series over finite fields. In Ladde GS, Medhin NG, Sambandham M, editors, Proceedings of Dynamic Systems and Applications - 4th International Conference on Dynamic Systems and Applications. 2003. p. 68-73