English
Related papers

Related papers: Two low differentially uniform power permutations …

200 papers

In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…

Number Theory · Mathematics 2020-03-03 Zhi-Wei Sun

Partially APN functions attract researchers' particular interest recently. It plays an important role in studying APN functions. In this paper, based on the multivariate method and resultant elimination, we propose several new infinite…

Information Theory · Computer Science 2022-10-06 Yan-Ping Wang , Zhengbang Zha

In the paper, we concentrate on the map $x\mapsto x^{\frac{p^n+1}{2}}$ on $\mathbb{F}_{p^n}$ and using combinatorial and number theory techniques, we compute its detailed $c$-differential spectrum for all values of $c\neq 1$ (the spectrum…

Information Theory · Computer Science 2022-10-25 Constanza Riera , Pantelimon Stanica , Haode Yan

Let $A$ be a ring with $1\neq 0$, not necessarily finite, endowed with an involution~$*$, that is, an anti-automorphism of order $\leq 2$. Let $H_n(A)$ be the additive group of all $n\times n$ hermitian matrices over $A$ relative to $*$.…

Representation Theory · Mathematics 2016-11-02 Fernando Szechtman

The motivating question for this work is a long standing open problem, posed by Nisan (1991), regarding the relative powers of algebraic branching programs (ABPs) and formulas in the non-commutative setting. Even though the general question…

Computational Complexity · Computer Science 2021-03-02 Prerona Chatterjee

The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research. In recent years the subject has found important applications in the modelling of…

Number Theory · Mathematics 2016-06-16 Andreas Aabrandt , Vagn Lundsgaard Hansen

Two-to-one ($2$-to-$1$) mappings over finite fields play an important role in symmetric cryptography. In particular they allow to design APN functions, bent functions and semi-bent functions. In this paper we provide a systematic study of…

Information Theory · Computer Science 2019-07-03 Sihem Mesnager , Longjiang Qu

We present a general technique for obtaining permutation polynomials over a finite field from permutations of a subfield. By applying this technique to the simplest classes of permutation polynomials on the subfield, we obtain several new…

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

In this paper, by the Hasse-Weil bound, we determine the necessary and sufficient condition on coefficients $a_1,a_2,a_3\in\mathbb{F}_{2^n}$ with $n=2m$ such that $f(x) = {x}^{3\cdot2^m} + a_1x^{2^{m+1}+1} + a_2 x^{2^m+2} + a_3x^3$ is an…

Information Theory · Computer Science 2020-07-09 Kangquan Li , Chunlei Li , Tor Helleseth , Longjiang Qu

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

A permutation array $A$ is a set of permutations on a finite set $\Omega$, say of size $n$. Given distinct permutations $\pi, \sigma\in \Omega$, we let $hd(\pi, \sigma) = |\{ x\in \Omega: \pi(x) \ne \sigma(x) \}|$, called the Hamming…

Combinatorics · Mathematics 2018-09-12 Sergey Bereg , Zevi Miller , Luis Gerardo Mojica , Linda Morales , I. H. Sudborough

The results of Strassen and Raz show that good enough tensor rank lower bounds have implications for algebraic circuit/formula lower bounds. We explore tensor rank lower and upper bounds, focusing on explicit tensors. For odd d, we…

Computational Complexity · Computer Science 2012-03-05 Boris Alexeev , Michael Forbes , Jacob Tsimerman

The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…

Commutative Algebra · Mathematics 2021-10-07 H. Al-Ezeh , A. A. Al-Maktry , S. Frisch

We extend a technique, originally due to the first author and Poonen, for proving cases of the Strong Uniform Boundedness Principle (SUBP) in algebraic dynamics over function fields of positive characteristic. The original method applied to…

Number Theory · Mathematics 2022-12-20 John R. Doyle , Xander Faber

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

Let $p>3$ and consider a prime power $q=p^h$. We completely characterize permutation polynomials of $\mathbb{F}_{q^2}$ of the type $f_{a,b}(X) = X(1 + aX^{q(q-1)} + bX^{2(q-1)}) \in \mathbb{F}_{q^2}[X]$. In particular, using connections…

Combinatorics · Mathematics 2019-11-22 Daniele Bartoli , Marco Timpanella

Generalized almost perfect nonlinear (GAPN) functions were defined to satisfy some generalizations of basic properties of almost perfect nonlinear (APN) functions for even characteristic. In this paper, we study monomial GAPN functions for…

Combinatorics · Mathematics 2017-08-03 Masamichi Kuroda

In this paper, two structural results concerning low degree polynomials over finite fields are given. The first states that over any finite field $\mathbb{F}$, for any polynomial $f$ on $n$ variables with degree $d \le \log(n)/10$, there…

Computational Complexity · Computer Science 2014-04-03 Gil Cohen , Avishay Tal

We study the characteristic polynomial of random permutation matrices following some measures which are invariant by conjugation, including Ewens' measures which are one-parameter deformations of the uniform distribution on the permutation…

Probability · Mathematics 2018-09-17 Valentin Bahier

For all finite fields of $q$ elements where $q\equiv1\pmod4$ we have constructed permutation polynomials which have order 2 as permutations, and have 3 terms, or 4 terms as polynomials. Explicit formulas for their coefficients are given in…

Number Theory · Mathematics 2023-11-28 P Vanchinathan , Anitha G