English
Related papers

Related papers: Unimodular Polynomial Matrices over Finite Fields

200 papers

We investigate interconnected aspects of hyperderivatives of polynomials over finite fields, q-th powers of polynomials, and specializations of Vandermonde matrices. We construct formulas for Carlitz multiplication coefficients using…

Number Theory · Mathematics 2025-07-08 Matthew A. Papanikolas

This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…

Combinatorics · Mathematics 2026-01-13 Todd Hildebrant

We investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of…

Rings and Algebras · Mathematics 2012-08-13 Andreas Kendziorra , Stefan E. Schmidt , Jens Zumbrägel

We investigate some Galois groups of linearized polynomials over fields such as $\mathbb{F}_q(t)$. The space of roots of such a polynomial is a module for its Galois group. We present a realization of the symmetric powers of this module, as…

Number Theory · Mathematics 2022-06-06 Rod Gow , Gary McGuire

Kopparty and Wang studied in [3] the relation between the roots of a univariate polhynomial over GF(q) and the zero-nonzero pattern of its coefficients. We generalize their results to polynomials in more variables.

Number Theory · Mathematics 2014-10-06 Olav Geil

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

Number Theory · Mathematics 2014-07-02 Ryul Kim , Ok-Hyon Song , Hyon-Chol Ri

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

Number Theory · Mathematics 2010-08-12 Melsik K. Kyuregyan , Gohar M. Kyureghyan

A finitely generated quadratic module or preordering in the real polynomial ring is called stable, if it admits a certain degree bound on the sums of squares in the representation of polynomials. Stability, first defined explicitly by…

Algebraic Geometry · Mathematics 2008-07-29 Tim Netzer

We determine all permutation polynomials among several families of polynomials over $\mathbb{F}_{q^3}$ for arbitrary prime powers $q$. We obtain some new families of permutation polynomials over $\mathbb{F}_{q^3}$ with simple coefficients…

Combinatorics · Mathematics 2026-05-18 Zhiguo Ding , Xu Song , Wei Xiong

We answer a question by Niederreiter concerning the enumeration of a class of subspaces of finite dimensional vector spaces over finite fields by proving a conjecture by Ghorpade and Ram.

Combinatorics · Mathematics 2021-02-16 Eric Chen , Dennis Tseng

A number of authors have proven explicit versions of Lehmer's conjecture for polynomials whose coefficients are all congruent to 1 modulo m. We prove a similar result for polynomials f(X) that are divisible in (Z/mZ)[X] by a polynomial of…

Number Theory · Mathematics 2010-08-24 Joseph H. Silverman

We define a convex-polynomial to be one that is a convex combination of the monomials $\{1, z, z^2, \ldots\}$. This paper explores the intimate connection between peaking convex-polynomials, interpolating convex-polynomials, invariant…

Functional Analysis · Mathematics 2015-07-31 Nathan S. Feldman , Paul McGuire

An algorithm for factoring polynomials over finite fields is given by Berlekamp in 1967. The main tool was the matrix Q corresponding to each polynomial. This paper studies the degrees of polynomials over binary field that associated with…

Number Theory · Mathematics 2017-04-13 Yaotsu Chang , Chong-Dao Lee , Chia-an Liu

We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…

Combinatorics · Mathematics 2007-05-23 Bruce Sagan

The Schinzel hypothesis essentially claims that finitely many irreducible polynomials in one variable over Z simultaneously assume infinitely many prime values unless there is an obvious reason why this is impossible. We prove that under a…

Number Theory · Mathematics 2016-03-29 Andreas O. Bender , Olivier Wittenberg

By [R. Bautista, P. Gabriel, A.V Roiter., L. Salmeron, Representation-finite algebras and multiplicative basis. Invent. Math. 81 (1985) 217-285.], a finite-dimensional algebra having finitely many isoclasses of indecomposable…

Representation Theory · Mathematics 2007-11-17 Andrej V. Roiter , Vladimir V. Sergeichuk

We consider a tuple $\Phi = (\phi_1,\ldots,\phi_m)$ of commuting maps on a finitary matroid $X$. We show that if $\Phi$ satisfies certain conditions, then for any finite set $A\subseteq X$, the rank of $\{\phi_1^{r_1}\cdots\phi_m^{r_m}(a):a…

Combinatorics · Mathematics 2025-02-06 Antongiulio Fornasiero , Elliot Kaplan

In this paper, we get several new results on permutation polynomials over finite fields. First, by using the linear translator, we construct permutation polynomials of the forms $L(x)+\sum_{j=1}^k \gamma_jh_j(f_j(x))$ and…

Number Theory · Mathematics 2014-06-03 Xiaoer Qin , Guoyou Qian , Shaofang Hong

In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the…

We establish a version of the Pommerenke-Levin-Yoccoz inequality for the modulus of a polynomial-like restriction of a global polynomial and give two applications. First it is shown that if the modulus of a polynomial-like restriction of an…

Dynamical Systems · Mathematics 2022-02-08 Alexander Blokh , Lex Oversteegen , Vladlen Timorin