English
Related papers

Related papers: Permutation Polynomials modulo m

200 papers

We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…

Commutative Algebra · Mathematics 2014-06-20 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

In \cite{D1}, Dickson listed all permutation polynomials up to degree 5 over an arbitrary finite field, and all permutation polynomials of degree 6 over finite fields of odd characteristic. The classification of degree 6 permutation…

Combinatorics · Mathematics 2010-02-16 Jiyou Li , David B. Chandler , Qing Xiang

In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these…

Combinatorics · Mathematics 2015-04-10 Shi-Mei Ma , Yeong-Nan Yeh

We classify complete permutation polynomials of type $aX^{\frac{q^n-1}{q-1}+1}$ over the finite field with $q^n$ elements, for $n+1$ a prime and $n^4 < q$. For the case $n+1$ a power of the characteristic we study some known families. We…

Combinatorics · Mathematics 2017-02-20 Daniele Bartoli , Massimo Giulietti , Luciane Quoos , Giovanni Zini

In this paper, by analyzing the quadratic factors of an $11$-th degree polynomial over the finite field $\ftwon$, a conjecture on permutation trinomials over $\ftwon[x]$ proposed very recently by Deng and Zheng is settled, where $n=2m$ and…

Information Theory · Computer Science 2018-09-11 Nian Li , Qiaoyu Hu

Permutation polynomials have been a subject of study for a long time and have applications in many areas of science and engineering. However, only a small number of specific classes of permutation polynomials are described in the literature…

Information Theory · Computer Science 2014-02-25 Cunsheng Ding , Longjiang Qu , Qiang Wang , Jin Yuan , Pingzhi Yuan

Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication…

Information Theory · Computer Science 2015-09-01 Kangquan Li , Longjiang Qu , Xi Chen

Much is known about binomial coefficients where primes are concerned, but considerably less is known regarding prime powers and composites. This paper provides two conjectures in these directions, one about counting binomial coefficients…

Number Theory · Mathematics 2011-02-09 Eric Rowland

We construct a class of permutation polynomials of $\bF_{2^m}$ that are closely related to Dickson polynomials.

Combinatorics · Mathematics 2007-05-23 Henk D. L. Hollmann , Qing Xiang

We study degree preserving maps over the set of irreducible polynomials over a finite field. In particular, we show that every permutation of the set of irreducible polynomials of degree $k$ over $\mathbb{F}_q$ is induced by an action from…

Number Theory · Mathematics 2018-09-21 Lucas Reis , Qiang Wang

We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.

Number Theory · Mathematics 2012-09-19 Qiang Wang

Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…

Rings and Algebras · Mathematics 2009-12-08 Marla Slusky

We consider the two permutation statistics which count the distinct pairs obtained from the last two terms of occurrences of patterns t_1...t_{m-2}m(m-1) and t_1...t_{m-2}(m-1)m in a permutation, respectively. By a simple involution in…

Combinatorics · Mathematics 2007-05-23 Astrid Reifegerste

In this paper, we construct several new permutation polynomials over finite fields. First, using the linearized polynomials, we construct the permutation polynomial of the form $\sum_{i=1}^k(L_{i}(x)+\gamma_i)h_i(B(x))$ over ${\bf…

Number Theory · Mathematics 2019-02-20 Xiaoer Qin , Shaofang Hong

In this paper, we present the compositional inverses of several classes permutation polynomials of the form $\sum_{i=1}^kb_i(x^{p^m}+x+\delta)^{s_i}-x$ over $\mathbb{F}_{p^{2m}}$, where for $1\leq i \leq k,$ $s_i, m$ are positive integers,…

Number Theory · Mathematics 2024-09-30 Danyao Wu , Pingzhi Yuan , Huanhuan Guan , Juan Li

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…

Number Theory · Mathematics 2022-10-04 Artūras Dubickas , Min Sha

A class of self-inversive polynomials includes all the self-reciprocal polynomials. Let A denote the set of all self-reciprocal polynomials with n+1 coefficients. Let B denote the set of certain self-inversive and non self-reciprocal…

Complex Variables · Mathematics 2017-04-04 Keisuke Uchimura

We show that there is a bijection between real-linear automorphisms of the multicomplex numbers of order $n$ and signed permutations of length $2^{n-1}$. This allows us to deduce a number of results on the multicomplex numbers, including a…

Rings and Algebras · Mathematics 2022-11-28 Nicolas Doyon , Pierre-Olivier Parisé , William Verreault

We consider a certain mixed polynomial which is an extended Lens equation $L_{n,m}=\bar z^m-p(z)/q(z)$ with $\text{degree}\, q=n$, $\text{degree}\, p<n$ whose numerator is a mixed polynomial of degree $(n+m;n,m)$. Then we consider its…

Algebraic Geometry · Mathematics 2015-10-21 Mutsuo Oka

Quadratic permutation polynomial interleavers over integer rings have recently received attention in practical turbo coding systems from deep space applications to mobile communications. In this correspondence, a necessary and sufficient…

Information Theory · Computer Science 2011-02-11 Jonghoon Ryu , Oscar Y. Takeshita
‹ Prev 1 4 5 6 7 8 10 Next ›