Counting dynamical systems over finite fields
Alina Ostafe, Min Sha
TL;DR
This paper extends previous research by developing methods to count distinct dynamical systems over finite fields generated by polynomials or rational functions, enhancing understanding of their classification.
Contribution
It introduces new techniques for counting non-equivalent dynamical systems over finite fields, focusing on polynomials and rational functions.
Findings
Derived formulas for counting dynamical systems
Extended classification of systems over finite fields
Improved understanding of system equivalence
Abstract
We continue previous work to count non-equivalent dynamical systems over finite fields generated by polynomials or rational functions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Coding theory and cryptography · Polynomial and algebraic computation