English
Related papers

Related papers: A note on two classes of permutation polynomials o…

200 papers

We give an explicit formula of the coefficients of the Zeta-Function's L-polynomial for algebraic function fields over finite constant fields. Thus, we deduce an expression of the class number of algebraic function fields defined over…

Algebraic Geometry · Mathematics 2026-02-26 Mahdi Mohamed Koutchoukali

We give an account of our work on transitive factorizations of permutations. The work has had impact upon other areas of mathematics such as the enumeration of graph embeddings, random matrices, branched covers, and the moduli spaces of…

Combinatorics · Mathematics 2014-07-30 I. P. Goulden , D. M. Jackson

Let $\mu_{q+1}$ denote the set of $(q+1)$-th roots of unity in $\mathbb{F}_{q^2 }$. We construct permutation polynomials over $\mathbb{F}_{q^2}$ by using rational functions of any degree that induce bijections either on $\mu_{q+1}$ or…

Combinatorics · Mathematics 2018-02-15 Daniele Bartoli , Ariane M. Masuda , Luciane Quoos

We consider some combinatorial problems on matrix polynomials over finite fields. Using results from control theory we give a proof of a result of Helmke, Jordan and Lieb on the number of linear unimodular matrix polynomials over a finite…

Combinatorics · Mathematics 2020-05-11 Akansha Arora , Samrith Ram , Ayineedi Venkateswarlu

We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…

Number Theory · Mathematics 2016-01-19 Eric Y. Chen , J. T. Ferrara , Liam Mazurowski

Let $F$ be an infinite field, and let $M_{n}(F)$ be the algebra of $n\times n$ matrices over $F$. Suppose that this algebra is equipped with an elementary grading whose neutral component coincides with the main diagonal. In this paper, we…

Rings and Algebras · Mathematics 2020-01-03 Luís Felipe Gonçalves Fonseca , Thiago Castilho de Mello

In this short note, we give a new sufficient condition for a linear map from a product of copies of a field to endomorphisms of a finite dimensional vector space over the same field to be an algebra homomorphism. We expect that this result…

Rings and Algebras · Mathematics 2015-07-31 Rajesh S. Kulkarni , Yusuf Mustopa , Ian Shipman

Let $f=a\x+\x^{3q-2}\in\Bbb F_{q^2}[\x]$, where $a\in\Bbb F_{q^2}^*$. We prove that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following occurs: (i) $q=2^e$, $e$ odd, and $a^{\frac{q+1}3}$ is a primitive…

Number Theory · Mathematics 2013-12-24 Xiang-dong Hou , Stephen D. Lappano

The characteristic polynomial plays an important role in study of hyperplane arrangements. There are several refinements of the characteristic polynomial. One of them is the coboundary polynomial defined by Crapo. Another refinement is the…

Combinatorics · Mathematics 2025-12-12 Masamichi Kuroda , Norihiro Nakashima , Shuhei Tsujie

We study the class of polynomials that map a local field (i.e., the completion of a number field at a non-Archimedean place) into the subset of its $p$-th powers, where $p$ is the residue characteristic of the field in question. We present…

Number Theory · Mathematics 2025-11-12 Przemysław Koprowski

We study in detail the class of even polynomials and their behavior with respect to finite free convolutions. To this end, we use some specific hypergeometric polynomials and a variation of the rectangular finite free convolution to…

Classical Analysis and ODEs · Mathematics 2025-12-23 Jacob Campbell , Rafael Morales , Daniel Perales

Inspired by a recent work of Mesnager, we present several new infinite families of quadratic ternary bent, near-bent and 2-plateaued functions from some known quadratic ternary bent functions. Meanwhile, the distribution of the Walsh…

Information Theory · Computer Science 2015-08-17 Guangkui Xu , Xiwang Cao

We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.

Commutative Algebra · Mathematics 2007-06-11 Arnaud Bodin

Planar functions over finite fields give rise to finite projective planes and other combinatorial objects. They were originally defined only in odd characteristic, but recently Zhou introduced a definition in even characteristic which…

Combinatorics · Mathematics 2016-03-04 Zachary Scherr , Michael E. Zieve

We introduce the notion of "quasi-symmetric" polynomials, which is a generalization of the notion of symmetry, and is particularly suited to the setting of polynomial rings over finite fields. The properties of this new class of functions…

Number Theory · Mathematics 2007-05-23 Vinay Deolalikar

Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying p_S(x+y)=\sum_{T\uplus U=S}p_T(x)p_U(y). Using umbral calculus, we give a formula for the expansion of such a set map in terms of any…

Combinatorics · Mathematics 2007-07-06 Gus Wiseman

We classify the pairs of polynomials $f,g$ over a field $K$, such that $f(X)-g(Y)$ has a factor of total degree at most 2. This was done by Y. Bilu for characteristic 0 fields $K$. As his method does not work in positive characteristic, we…

Number Theory · Mathematics 2019-07-30 Manisha Kulkarni , Peter Müller , B. Sury

The fundamental theorem of symmetric polynomials over rings is a classical result which states that every unital commutative ring is fully elementary, i.e. we can express symmetric polynomials with elementary ones in a unique way. The…

Commutative Algebra · Mathematics 2026-03-03 Sara Kališnik , Davorin Lešnik

The concept of differential uniformity was recently extended to the $c$-differential uniformity. An interesting problem in this area is the construction of functions with low $c$-differential uniformity and a lot of research has been done…

Information Theory · Computer Science 2022-08-02 Mohit Pal

An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…

Information Theory · Computer Science 2011-12-08 Michele Elia , Joachim Rosenthal , Davide Schipani