### Abstract

A discrete time series over a field F, With π state sets and m time steps, can be described by a function f = (f_{1},...,f_{n}): F^{n} →F^{n}, When F Is a finite field, it is well known that each coordinate function f_{i} 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 language | English |
---|---|

Title of host publication | Proceedings of Dynamic Systems and Applications - 4th International Conference on Dynamic Systems and Applications |

Editors | G.S. Ladde, N.G. Medhin, M. Sambandham |

Pages | 68-73 |

Number of pages | 6 |

State | Published - 1 Dec 2003 |

Event | Proceedings of the 4th International Conference on Dynamic Systems and Applications - Atlanta, GA, United States Duration: 21 May 2003 → 24 May 2003 |

### Other

Other | Proceedings of the 4th International Conference on Dynamic Systems and Applications |
---|---|

Country | United States |

City | Atlanta, GA |

Period | 21/05/03 → 24/05/03 |

### Fingerprint

### Cite this

*Proceedings of Dynamic Systems and Applications - 4th International Conference on Dynamic Systems and Applications*(pp. 68-73)

}

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-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 -