相关论文: Bounds on the differential uniformity of the Wan-L…

Motivated by the effective bounds of ordinary differential equations, we prove an effective version of uniform bounding for partial differential fields with commuting derivations. More precisely, we provide an upper bound for the size of…

The notion of $c$-differential uniformity has recently received a lot of attention since its proposal~\cite{Ellingsen}, and recently a characterization of perfect $c$-nonlinear functions in terms of difference sets in some quasigroups was…

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of…

Finding functions, particularly permutations, with good differential properties has received a lot of attention due to their varied applications. For instance, in combinatorial design theory, a correspondence of perfect $c$-nonlinear…

We prove that polynomials of degree 10 over finite fields of even characteristic with some conditions on theirs coefficients have a differential uniformity greater than or equal to 6 over $\mathbb{F}_{2^n}$ for all $n$ sufficiently large.

A well-known result of von zur Gathen asserts that a non-exceptional permutation polynomial of degree $n$ over $\mathbb{F}_{q}$ exists only if $q<n^{4}$. With the help of the Weil bound for the number of $\mathbb{F}_{q}$-points on an…

We establish effective bounds on the number of periodic points of degree-$d$ polynomials $\phi$ defined over $p$-adic fields and number fields, under a mild reduction hypothesis that is satisfied by all unicritical polynomials $X^d + c$…

We find a formula for the number of permutation polynomials of degree q-2 over a finite field Fq, which has q elements, in terms of the permanent of a matrix. We write down an expression for the number of permutation polynomials of degree…

We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, two conjectures on permutation polynomials proposed recently by Wu and Li [19] are…

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

We obtain new upper bounds on the number of distinct roots of lacunary polynomials over finite fields. Our focus will be on polynomials for which there is a large gap between consecutive exponents in the monomial expansion.

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

We give a lower bound for the value at q=1 of a Kazhdan-Lustig polynomial in a Weyl group W in terms of "patterns''. This is expressed by a "pattern map" from W to W' for any parabloic subgroup W'. This notion generalizes the concept of…

In this paper, we present three classes of complete permutation monomials over finite fields of odd characteristic. Meanwhile, the compositional inverses of these complete permutation polynomials are also proposed.

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…

We study a class of general quadrinomials over the field of size $2^{2m}$ with odd $m$ and characterize conditions under which they are permutations with the best boomerang uniformity, a new and important parameter related to…

We obtain upper bounds for the number of monic irreducible polynomials over $\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting…

We present new classes of permutation polynomials over finite fields.