Related papers: On $k$-PN Functions over Finite Fields

Planar functions over finite fields give rise to finite projective planes and other combinatorial objects. They exist only in odd characteristic, but recently Zhou introduced an even characteristic analogue which has similar applications.…

We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…

We show that for infinitely many primes $p$, there exist dual functions of order $k$ over $\mathbb{F}_p^n$ that cannot be approximated in $L_\infty$-distance by polynomial phase functions of degree $k-1$. This answers in the negative a…

This paper gives examples of function fields $K_0$ over a finite field $\mathbb{F}_q$ of $p$ power order ramified only at one finite regular prime over $\mathbb{F}_q(t)$, which admit infinite Hilbert $p$-class field towers. Such a $K_0$ can…

We introduce sequences of functions orthogonal on a finite interval: proper orthogonal rational functions, orthogonal exponential functions, orthogonal logarithmic functions, and transmuted orthogonal polynomials

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…

Knop constructed a tensor category associated to a finitely-powered regular category equipped with a degree function. In recent work with Harman, we constructed a tensor category associated to an oligomorphic group equipped with a measure.…

We develop global pluripotential theory in the setting of Berkovich geometry over a trivially valued field. Specifically, we define and study functions and measures of finite energy and the non-Archimedean Monge-Ampere operator on any…

In this article a procedure to construct bent functions from $\F_{p^n}$ to $\F_p$ by merging plateaued functions which are bent on ($n-2$)-dimensional subspaces of $\F_{p^n}$ is presented. Taking advantage of such classes of plateaued…

We investigate the finitary functions from a finite product of finite fields $\prod_{j =1}^m\mathbb{F}_{q_j} = \mathbb{K}$ to a finite product of finite fields $\prod_{i =1}^n\mathbb{F}_{p_i} = \mathbb{F}$, where $|\mathbb{K}|$ and…

For a large prime $p$, a rational function $\psi \in F_p(X)$ over the finite field $F_p$ of $p$ elements, and integers $u$ and $H\ge 1$, we obtain a lower bound on the number consecutive values $\psi(x)$, $x = u+1, \ldots, u+H$ that belong…

We study finiteness properties, especially the noetherian property, the Krull dimension and a variation of finite presentation, in categories of polynomial functors from a small symmetric monoidal category whose unit is an initial object to…

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

We explain the concept of p-values presupposing only rudimentary probability theory. We also use the occasion to introduce the notion of p-function, so that p-values are values of a p-function. The explanation is restricted to the discrete…

We consider simple rational functions $R_{mn}(x)=P_m(x)/Q_n(x)$, with $P_m$ and $Q_n$ polynomials of degree $m$ and $n$ respectively. We look for "nice" functions, which we define to be ones where as many as possible of the roots, poles,…

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

We study rational functions over finite fields under PGL-equivalence. We say that $f, g \in \Bbb F_q(X)$ are \emph{equivalent} if there exist $\psi, \phi \in \Bbb F_q(X)$ of degree one such that $g = \psi \circ f \circ \phi$. Most…