A New Universal Definition of Fq [t] in Fq (t)
Abstract
This paper gives a universal definition of Fq [t] in Fq (t) using 89 quantifiers, more direct than those that exist in the current literature. The language Lrings, t we consider here is the language of rings \0, 1, +, -, ·\ with an additional constant symbol t. We then modify this definition marginally to universally define Fq [t] in Fq (t) without parameters, using 90 quantifiers. We assume throughout that the characteristic of Fq is odd.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.