Related papers: Exceptional planar polynomials
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…
A class of parametric functions formed by alternating compositions of multivariate polynomials and rectification style monomial maps is studied (the layer-wise exponents are treated as fixed hyperparameters and are not optimized). For this…
Permutation trinomials over finite fields consititute an active research due to their simple algebraic form, additional extraordinary properties and their wide applications in many areas of science and engineering. In the present paper, six…
In this paper, a construction of complete permutation polynomials over finite fields of even characteristic proposed by Tu et al. recently is generalized in a recursive manner. Besides, several classes of complete permutation polynomials…
The so-called polynomial equations play an important role both in algebra and in the theory of functional equations. If the unknown functions in the equation are additive, relatively many results are known. However, even in this case, there…
We introduce the notion of "quasi-symmetric" polynomials, which is a generalization of the notion of symmetry, and is particularly suited to the setting of polynomial rings over finite fields. The properties of this new class of functions…
This article aims to reinforce the broad applicability of the umbral approach to address complex mathematical challenges and contribute to various scientific and engineering endeavors. The umbral methods are used to reformulate the…
The Lie algebra of planar vector fields with coefficients from the field of rational functions over an algebraically closed field of characteristic zero is considered. We find all finite-dimensional Lie algebras that can be realized as…
Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…
Let $\mathbb{F}_p$ be the finite field of prime order $p$. For any function $f \colon \mathbb{F}_p{}^n \to \mathbb{F}_p$, there exists a unique polynomial over $\mathbb{F}_p$ having degree at most $p-1$ with respect to each variable which…
We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.
We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…
We adapt (over $\mathbb{F}_2$) the general notions of multiplicative function, Dirichlet convolution and Inverse. We get some interesting results, namely necessary conditions for an odd binary polynomial to be perfect. Note that we are…
We introduce a notion of planar algebra, the simplest example of which is a vector space of tensors, closed under planar contractions. A planar algebra with suitable positivity properties produces a finite index subfactor of a II_1 factor,…
In this paper, as an extension of the integer case, we define polynomial functions over the residue class rings of Dedekind domains, and then we give canonical representations and counting formulas for such polynomial functions. In…
In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…
For all finite fields of order up to $2^{30}$, we computationally prove that there are no planar monomials besides the ones already known.
We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…
In the paper I study properties of random polynomials with respect to a general system of functions. Some lower bounds for the mathematical expectation of the uniform and recently introduced integral-uniform norms of random polynomials are…
We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…