Related papers: Some new classes of (almost) perfect $c$-nonlinear…
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…
In this paper we present a new class of perfect nonlinear %Dembowski-Ostrom polynomials over $\mathbb{F}_{p^{2k}}$ for any odd prime $p$. In addition, we show that the new perfect nonlinear functions are CCZ-inequivalent to all the…
We present new classes of permutation polynomials over finite fields.
In this paper we generalize Dillon's switching method to characterize the exact $c$-differential uniformity of functions constructed via this method. More precisely, we modify some PcN/APcN and other functions with known $c$-differential…
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 consider distributions on $\mathbb{R}$ that can be written as the sum of a non-zero discrete distribution and an absolutely continuous distribution. We show that such a distribution is quasi-infinitely divisible if and only if its…
The $1/x^{2}$ deformed $c=1$ matrix model is studied at finite radius and non-zero cosmological constant. Calculational techniques are presented and illustrated in some examples. Furthermore, a new kind of $R \rightarrow 1/R$ duality is…
Functorial semi-norms are semi-normed refinements of functors such as singular (co)homology. We investigate how different types of representability affect the (non-)triviality of finite functorial semi-norms on certain functors or classes.…
In this article, we study algebraic decompositions and secondary constructions of almost perfect nonlinear (APN) functions. In many cases, we establish precise criteria which characterize when certain modifications of a given APN function…
An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some resemblances and some differences between permutations and…
Permutation polynomials over finite fields have taken an important role in vast areas in mathematics as well as engineering. Recently, Tu et al. gave some classes of complete permutation polynomials over finite fields of even…
Permutation polynomials with explicit constructions over finite fields have long been a topic of great interest in number theory. In recent years, by applying linear translators of functions from $\mathbb{F}_{q^n}$ to $\mathbb{F}_q$, many…
We propose several techniques to construct complete permutation polynomials of finite fields by virtue of complete permutations of subfields. In some special cases, any complete permutation polynomials over a finite field can be used to…
In this paper, we construct some piecewise defined functions, and study their $c$-differential uniformity. As a by-product, we improve upon several prior results. Further, we look at concatenations of functions with low differential…
We prove that a linear nonautonomous differential system with nonuniform hyperbolicity on the half line can be expressed as diagonal system with a perturbation which is small enough. Moreover we show that the diagonal terms are contained in…
We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two…
Recently, the interest in semifields has increased due to the discovery of several new families and progress in the classification problem. Commutative semifields play an important role since they are equivalent to certain planar functions…
Generalising the concept of a complete permutation polynomial over a finite field, we define completness to level $k$ for $k\ge1$ in fields of odd characteristic. We construct two families of polynomials that satisfy the condition of high…
Permutation polynomials over finite fields have important applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, etc. In this paper, we construct several new classes of permutation…
Permutation polynomials over finite fields are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics. This family of polynomials…