Classifying All Degrees Below $N^3$
Noah Kaufmann

TL;DR
This paper classifies the degrees of all cubic polynomials below $n^3$ within the framework of transducer degrees, answering an open question about the structure of polynomial transducer degrees.
Contribution
It provides a complete classification of the degrees of cubic polynomials below $n^3$, advancing understanding of the structure of polynomial transducer degrees.
Findings
Classified degrees of all cubic polynomials below $n^3$
Developed methods applicable to higher-order polynomials
Answered an open question in transducer degree theory
Abstract
We answer an open question in the theory of transducer degrees initially posed in [3], on the structure of polynomial transducer degrees, in particular the question of what degrees, if any, lie below the degree of . Transducer degrees are the equivalence classes formed by word transformations which can be realized by a finite-state transducer. While there are no general techniques to tell if a word can be transformed into via an FST, the work of Endrullis et al. in [2] provides a test for the class of spiralling functions, which includes all polynomials. We classify fully the degrees of all cubic polynomials which are below , and many of the methods can also be used to classify the degrees of polynomials of higher orders.
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 · Computability, Logic, AI Algorithms · Algorithms and Data Compression
