Related papers: Counting irreducible binomials over finite fields
In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite extensions of finite fields, enriched with some not published recent results as well as analyzes enhancing the qualitative…
The purpose of these notes is to collect in one place some facts on the category of finite totally ordered sets and some related categories. More specifically, we collect some results on them which will be useful for the study of iteratedly…
In this paper we construct an infinite sequence of binary irreducible polynomials starting from any irreducible polynomial $f_0 \in \F_2 [x]$. If $f_0$ is of degree $n = 2^l \cdot m$, where $m$ is odd and $l$ is a non-negative integer,…
We extend the theorem of Liouville on integration in finite terms to include dilogarithmic integrals. The results provide a necessary and sufficient condition for an element of the base field to have an antiderivative in a field extension…
Previous research on exceptional units has primarily focused on the ring of rational integers or abstract finite rings, often restricted to linear or quadratic constraints. In this paper, we extend the concept of polynomial-type exceptional…
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…
We provide a clarification of the classification of two-dimensional algebras over an arbitrary base field. Using this clarification, we determine the number of non-isomorphic two-dimensional algebras over a finite field.
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…
We perform the computations necessary to establish a multiplicity one statement for the irreducible representations of a finite spin group which in turn yields the classification of irreducible representations of finite spin groups. (The…
The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of…
We determine the dual modules of all irreducible modules of alternating groups over fields of characteristic 2.
We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…
This paper considers permutation polynomials over the finite field $F_{q^2}$ in even characteristic by utilizing low-degree permutation rational functions over $F_q$. As a result, we obtain two classes of permutation binomials and six…
In this paper we give a different proof of Kuz'min's result on the number of irreducible polynomials with the first two coefficients fixed. Our technique is to relate the question to the number of points on a curve, and to calculate the…
Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…
For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…
We compute an analogue of Pascal's triangle enriched in bilinear forms over a finite field. This gives an arithmetically meaningful count of the ways to choose $j$ ring homomorphisms into an algebraic closure from an \'etale extension of…
We evaluate binomial series with harmonic number coefficients, providing recursion relations, integral representations, and several examples. The results are of interest to analytic number theory, the analysis of algorithms, and…