English
Related papers

Related papers: Five Constructions of Permutation Polynomials over…

200 papers

We study a random polynomial of degree $n$ over the finite field $\mathbb{F}_q$, where the coefficients are independent and identically distributed and uniformly chosen from the squares in $\mathbb{F}_q$. Our main result demonstrates that…

Number Theory · Mathematics 2024-10-23 Lior Bary-Soroker , Roy Shmueli

We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…

Number Theory · Mathematics 2021-03-22 Anna Chlopecki , Juliano Levier-Gomes , Wayne Peng , Alex Shearer , Adam Towsley

In this paper we use algebraic curves and other algebraic number theory methods to show the validity of a permutation polynomial conjecture regarding $f(X)=X^{q(p-1)+1} +\alpha X^{pq}+X^{q+p-1}$, on finite fields $\mathbb{F}_{q^2}, q=p^k$,…

Number Theory · Mathematics 2024-10-31 Daniele Bartoli , Mohit Pal , Pantelimon Stanica

I present a construction of permutation polynomials based on cyclotomy, an additive analogue of this construction, and a generalization of this additive analogue which appears to have no multiplicative analogue. These constructions…

Number Theory · Mathematics 2013-10-08 Michael E. Zieve

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

The characterization of permutations over finite fields is an important topic in number theory with a long-standing history. This paper presents a systematic investigation of low-degree bivariate polynomial systems $F=(f_1(x,y),f_2(x,y))$…

Number Theory · Mathematics 2025-08-05 Xuan Pang , Yangcheng Li , Pingzhi Yuan , Yuanpeng Zeng

We introduce a new permutation statistic, namely, the number of cycles of length $q$ consisting of consecutive integers, and consider the distribution of this statistic among the permutations of $\{1,2,...,n\}$. We determine explicit…

Combinatorics · Mathematics 2015-03-17 Richard A. Brualdi , Emeric Deutsch

We study Schur Q-polynomials evaluated on a geometric progression, or equivalently q-enumeration of marked shifted tableaux, seeking explicit formulas that remain regular at q=1. We obtain several such expressions as multiple basic…

Combinatorics · Mathematics 2008-04-08 Hjalmar Rosengren

Let GF(q), q=p^r, be a finite field with a primitive element g. In this paper we use exponential sums and Jacobi sums to compute the number of the irreducible polynomials of degree m over GF(q) with trace fixed and norm restricted to a…

Number Theory · Mathematics 2007-10-16 K. Kononen , M. Moisio , M. Rinta-aho , K. Vaananen

In this paper, we use the generalized q-polynomials with double q-binomial coefficients and homogeneous q-operators [J. Difference Equ. Appl. 20 (2014), 837--851.] to construct q-difference equations with seven variables, which generalize…

Combinatorics · Mathematics 2021-12-23 Jian Cao , Sama Arjika , Mahouton Norbert Hounkonnou

Three specializations of a set of orthogonal polynomials with ``8 different q's'' are given. The polynomials are identified as $q$-analogues of Laguerre polynomials, and the combinatorial interpretation of the moments give infinitely many…

Classical Analysis and ODEs · Mathematics 2009-09-25 Rodica Simion , Dennis W. Stanton

Motivated by recent studies of large Mallows$(q)$ permutations, we propose a class of random permutations of $\mathbb{N}_{+}$ and of $\mathbb{Z}$, called regenerative permutations. Many previous results of the limiting Mallows$(q)$…

Probability · Mathematics 2019-06-18 Jim Pitman , Wenpin Tang

Any permutation polynomial is an $ n $-cycle permutation. When $n$ is a specific small positive integer, one can obtain efficient permutations, such as involutions, triple-cycle permutations and quadruple-cycle permutations. These…

Information Theory · Computer Science 2020-07-30 Yuting Chen , Liqi Wang , Shixin Zhu

The previous paper [4] proved the existence of primitive polynomials and primitive normal polynomials of degree n with k prescribed coefficients in the finite field GF(q) for all sufficiently large q. This paper presents a loger versions of…

Number Theory · Mathematics 2007-05-23 N. A. Carella

Let $q$ be a prime power. We construct stable polynomials of the form $b^{m-1}(x+a)^m+c(x+a)+d$ over a finite field $\mathbb{F}_{q}$ for $m=2,3,4$ by Capelli's lemma. When $m=3$ and $q$ is even, we confirm the conjecture of Ahmadi and…

Number Theory · Mathematics 2023-10-05 Tong Lin , Qiang Wang

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

Number Theory · Mathematics 2024-01-01 Ruikai Chen , Sihem Mesnager

We investigate the permutation property of polynomials of the form $x^{r}(x^{s} -a)^{t}$, and give the expressions of their inverses. In particular, explicit expressions of inverses of permutation polynomials $x(x^3 -a)^2$ and $x(x^2 -a)^3$…

Number Theory · Mathematics 2020-12-29 Yanbin Zheng , Yuyin Yu

Let F be a field of characteristic different from $2$, and let $UT_2(F)$ be the algebra of $2\times 2$ upper triangular matrices over $F$. For every involution of the first kind on $UT_2(F)$, we describe the set of all $*$-central…

Rings and Algebras · Mathematics 2019-02-07 Ronald Ismael Quispe Urure , Dimas José Gonçalves

Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…

General Mathematics · Mathematics 2021-07-06 Nathan Thomas Provost

In this paper, we prove that a binary definite quadratic form over F_q[t], where q is odd, is completely determined up to equivalence by the polynomials it represents up to degree 3m-2, where m is the degree of its discriminant. We also…

Number Theory · Mathematics 2011-11-15 Jean Bureau , Jorge Morales
‹ Prev 1 8 9 10 Next ›