vix.ing · top · new · best · stats · spec

A New Universal Definition of \mathbbFq [t] in \mathbbFq (t)

2019/05/14 by Brian Tyrrell, Tyrrell, Brian
Computer Science · Mathematics · #Algebraic structures and combinatorial models #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Logic (math.LO)

paper · pdf · doi:10.48550/arxiv.1905.05745

openalex publication_date 2019/05/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper gives a universal definition of \mathbbFq [t] in \mathbbFq (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 \mathbbFq [t] in \mathbbFq (t) without parameters, using 90 quantifiers. We assume throughout that the characteristic of \mathbbFq is odd.

Related