English
Related papers

Related papers: A Classification of Permutation Polynomials throug…

200 papers

Let $\mathbb F$ be a field and $P \in \mathbb F [x_1,\ldots, x_n]$ be a homogeneous polynomial such that $|\mathbb F| > \deg(P)$ and $\phi, \psi\colon \mathbb F^n \to \mathbb F^n$ be two maps such that $P(\mathbf{x} + \lambda\mathbf{y}) =…

Combinatorics · Mathematics 2026-04-28 Andrey Yurkov

$ n-$cycle permutation polynomials with small n have the advantage that their compositional inverses are efficient in terms of implementation. These permutation polynomials have significant applications in cryptography and coding theory. In…

Rings and Algebras · Mathematics 2025-06-30 Varsha Jarali , Prasanna Poojary , Vadiraja Bhatta G. R

In this work, free multivariate skew polynomial rings are considered, together with their quotients over ideals of skew polynomials that vanish at every point (which includes minimal multivariate skew polynomial rings). We provide a full…

Rings and Algebras · Mathematics 2019-08-20 Umberto Martínez-Peñas

Given a polynomial \( H(x) \) over \(\mathbb{F}_{q^n}\), we study permutation polynomials of the form \( x + \gamma \mathrm{Tr}(H(x)) \) over \(\mathbb{F}_{q^n}\). Let \[P_H=\{\gamma\in \mathbb{F}_{q^n} : x+\gamma \mathrm{Tr}(H(x))~\text{is…

Number Theory · Mathematics 2025-07-02 Yangcheng Li , Xuan Pang , Pingzhi Yuan , Yuanpeng Zeng

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…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

Let $p$ be a prime. In this paper, we give a complete classification of self-reciprocal polynomials arising from Fibonacci polynomials over $\mathbb{Z}$ and $\mathbb{Z}_p$, where $p=2$ and $p>5$. We also present some partial results when…

Number Theory · Mathematics 2019-01-01 Neranga Fernando , Mohammad Rashid

Let ${\bf M}_n(\mathbb{F})$ be the algebra of $n\times n$ matrices over an arbitrary field $\mathbb{F}$. We consider linear maps $\Phi: {\bf M}_n(\mathbb{F}) \rightarrow {\bf M}_r(\mathbb{F})$ preserving matrices annihilated by a fixed…

Functional Analysis · Mathematics 2023-02-23 Chi-Kwong Li , Ming-Cheng Tsai , Ya-Shu Wang , Ngai-Ching Wong

Let $q$ be a prime power and $n$ and $r$ be positive integers. It is well known that the linearized binomial $L_r(x)=x^{q^r}+ax\in\mathbb{F}_{q^n}[x]$ is a permutation polynomial if and only if $(-1)^{n/d}a^{{(q^n-1)}/{(q^{d}-1)}}\neq 1$…

Number Theory · Mathematics 2013-11-12 Baofeng Wu

We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…

Combinatorics · Mathematics 2024-08-20 Youming Qiao

Permutation polynomials of finite fields have many applications in Coding Theory, Cryptography and Combinatorics. In the first part of this paper we present a new family of local permutation polynomials based on a class of symmetric…

Discrete Mathematics · Computer Science 2022-05-03 Jaime Gutierrez , Jorge Jimenez Urroz

We introduce a class of polynomial maps that we call polynomial roots of powerseries, and show that automorphisms with this property generate the automorphism group in any dimension. In particular we determine generically which polynomial…

Complex Variables · Mathematics 2007-06-07 Stefan Maubach , Han Peters

Permutation polynomials over finite fields are an interesting subject due to their important applications in the areas of mathematics and engineering. In this paper we investigate the trinomial $f(x)=x^{(p-1)q+1}+x^{pq}-x^{q+(p-1)}$ over…

Information Theory · Computer Science 2017-10-04 Tao Bai , Yongbo Xia

In this paper, we present an isomorphism between the ring of general polynomials over a division ring of degree $p$ over its center $F$ and the group ring of the free monoid with $p^2$ variables. Using this isomorphism, we define the…

Rings and Algebras · Mathematics 2011-12-07 Adam Chapman

General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding…

Commutative Algebra · Mathematics 2016-04-01 Chiara Marcolla , Emmanuela Orsini , Massimiliano Sala

In 2019, Xiang Fan \cite{xfan} classified all permutation polynomials of degree $7$ over finite fields of odd characteristics. In this paper, we use this classification to determine the complete list of degree $7$ orthomorphism polynomials…

Number Theory · Mathematics 2026-01-30 Bhitali Kousik , Dhiren Kumar Basnet

Suppose that $f: \bR^n\to\bR^n$ is a mapping of $K$-bounded $p$-mean distortion for some $p>n-1$. We prove the equivalence of the following properties of $f$: doubling condition for $J(x,f)$ over big balls centered at origin, boundedness of…

Complex Variables · Mathematics 2024-10-15 Changyu Guo

This paper is about the study of F-transforms based on overlap and grouping maps, residual and co-residual implicator over complete lattice from both constructive and axiomatic approaches. Further, the duality, basic properties, and the…

Rings and Algebras · Mathematics 2023-01-31 Abha Tripathi , S. P. Tiwari , Sutapa Mahato

We study a graded vector space of polynomials associated to a square matrix, defined by a finite difference condition along the rows. We show this space coincides with one defined by directional derivatives, and prove it is…

Combinatorics · Mathematics 2026-05-05 Tristram Bogart , Federico Castillo , Damián de la Fuente , David Plaza

Let $r$ be a prime power and $q=r^m$. For $0\le i\le m-1$, let $f_i\in \mathbb{F}_r[x]$ be $q$-linearized and $a_i\in \mathbb{F}_q$. Assume that $z\in \mathbb{\bar{F}}_r$ satisfies the equation $\sum_{i=0}^{m-1}a_if_i(z)^{r^i}=0$, where…

Number Theory · Mathematics 2015-03-12 Neranga Fernando , Xiang-dong Hou

We present an algorithmic equivalent statement to the Jacobian conjecture. Given a polynomial map F on an affine space of dimension n, our algorithm constructs n sequences of polynomials such that F is invertible if and only if the zero…

Commutative Algebra · Mathematics 2015-06-05 Elzbieta Adamus , Pawel Bogdan , Teresa Crespo , Zbigniew Hajto