Cubic rational expressions over a finite field
Sandro Mattarei, Marco Pizzato

TL;DR
This paper classifies cubic rational expressions over finite fields, providing a complete classification for even fields and an upper bound for odd fields, advancing understanding of their structural properties.
Contribution
It offers a full classification of cubic rational expressions over finite fields when the field size is even, and establishes an upper bound for the number of classes when the field size is odd.
Findings
Complete classification for even finite fields
Upper bound of 4q for odd finite fields
Advances understanding of rational expressions over finite fields
Abstract
We study and partially classify cubic rational expressions over a finite field , up to pre- and post-composition with independent M\"obius transformations. In particular, we obtain a full classification when is even, and prove an upper bound of for the number of equivalence classes when is odd.
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
Topicssemigroups and automata theory · Coding theory and cryptography · Algorithms and Data Compression
