相关论文: Dembowski-Ostrom polynomials and reversed Dickson …

We give a complete classification of Dembowski-Ostrom polynomials from the composition of Dickson polynomials of arbitrary kind and monomials over finite fields. Moreover, by using a variant of the Weil bound for the number of points of…

We give a complete classification of Dembowski-Ostram polynomials from reversed Dickson polynomials in odd characteristic.

Let $F_{q}$ be a finite field of cardinality $q$. A polynomial over finite field $F_{q}$ of the form $\sum_{i,j}a_{ij}x^{p^{i}+p^{j}}$ is called a Dembowski-Ostrom (DO) polynomial. The Dembowski-Ostrom conjecture says that a planar…

Planar functions, introduced by Dembowski and Ostrom, are functions from a finite field to itself that give rise to finite projective planes. They exist, however, only for finite fields of odd characteristics. They have attracted much…

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…

Planar functions in odd characteristic were introduced by Dembowski and Ostrom in order to construct finite projective planes in 1968. They were also used in the constructions of DES-like iterated ciphers, error-correcting codes, and signal…

In [U. Dempwolff: More Translation Planes and Semifields from Dembowski-Ostrom Polynomials, Designs, Codes, Cryptogr. \textbf{68} (1-3) (2013), 81-103], the author gives a construction of three classes of rank two semifields of order…

We investigate fixed points and cycle types of permutation polynomials and complete permutation polynomials arising from reversed Dickson polynomials of the first kind and second kind over $\mathbb{F}_p$. We also study the permutation…

We discuss the properties and the permutation behaviour of the reversed Dickson polynomials of the $(k+1)$-th kind $D_{n,k}(1,x)$ over finite fields. The results in this paper unify and generalize several recently discovered results on…

By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…

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…

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…

At the first part of the paper we show how specific umbral extensions of the Stirling numbers of the second kind result in new type of Dobinski-like formulas. In the second part among others one recovers how and why Ward solution of…

Due to their important applications to coding theory, cryptography, communications and statistics, combinatorial $t$-designs have been attracted lots of research interest for decades. The interplay between coding theory and $t$-designs has…

Permutation polynomials (PPs) and their inverses have applications in cryptography, coding theory and combinatorial design theory. In this paper, we make a brief summary of the inverses of PPs of finite fields, and give the inverses of all…

Dual Bernstein polynomials find many applications in approximation theory, computational mathematics, numerical analysis and computer-aided geometric design. In this context, one of the main problems is fast and accurate evaluation both of…

We consider image sets of differentially $d$-uniform maps of finite fields. We present a lower bound on the image size of such maps and study their preimage distribution, by extending methods used for planar maps. We apply the results to…

The chromatic polynomials are studied by several authors and have important applications in different frameworks, specially, in graph theory and enumerative combinatorics. The aim of this work is to establish some properties of the…

Let $p$ be a prime and $n$ a positive integer. As the first main result, we present a deterministic algorithm for deciding whether the matrix algebra $\mathbb{F}_p[A_1,\dots,A_t]$ with $A_1,\dots,A_t \in \mathrm{GL}(n,\mathbb{F}_p)$ is a…

In this paper, we use (bi)semicosimplicial language to study the classical problem of infinitesimal deformations of a closed subscheme in a fixed smooth variety, defined over an algebraically closed field of characteristic 0. In particular,…