Related papers: On the characterization of minimal value set polyn…

We obtain a new lower bound on the size of value set f(F_p) of a sparse polynomial f in F_p[X] over a finite field of p elements when p is prime. This bound is uniform with respect of the degree and depends on some natural arithmetic…

Let K be a field. For a given valuation on K[x], we determine the structure of its graded algebra and describe its set of key polynomials, in terms of any given key polynomial of minimal degree. We also characterize valuations not admitting…

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…

A hyperoval in the projective plane $\mathbb{P}^2(\mathbb{F}_q)$ is a set of $q+2$ points no three of which are collinear. Hyperovals have been studied extensively since the 1950s with the ultimate goal of establishing a complete…

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…

Let $k \geq 2$ be an integer and $\mathbb F_q$ be a finite field with $q$ elements. We prove several results on the distribution in short intervals of polynomials in $\mathbb F_q[x]$ that are not divisible by the $k$th power of any…

Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.

We define a $q$-deformation of the classical ring of integer-valued polynomials which we call the ring of quantum integer-valued polynomials. We show that this ring has a remarkable combinatorial structure and enjoys many positivity…

We use a recent characterization of minimal value set polynomials and $q$- Frobenius nonclassical curves to construct curves that generalize the Hermitian curve. The genus $g$ and the number $N$ of $\mathbb{F}_q$-rational points of the…

The ring of polynomial over a finite field $F_q[x]$ has received much attention, both from a combinatorial viewpoint as in regards to its action on measurable dynamical systems. In the case of $(\mathbb{Z},+)$ we know that the ideal…

We utilize the same technique as in [arXiv:2205.04254 (2022)] to provide some representations of polynomials non-negative on a basic semi-algebraic set, defined by polynomial inequalities, under more general conditions. Based on each…

In this paper we give a new characterization of simple sets of polynomials B with the property that the set of B-multiplier sequences contains all Q-multiplier sequence for every simple set Q. We characterize sequences of real numbers which…

Polynomials and elements over finite fields exhibit closely related algebraic structures, and many properties defined for elements extend naturally to polynomials. The concepts of order and $\mathbb{F}_q$-Order for elements have been…

Littlewood polynomials are polynomials with each of their coefficients in $\{-1,1\}$. A sequence of Littlewood polynomials that satisfies a remarkable flatness property on the unit circle of the complex plane is given by the Rudin-Shapiro…

Let K be F_q((T)), or more generally any field of characteristic p equipped with a valuation having a finite residue field of q elements. Then a polynomial f(x) in K[x] having k+1 nonzero coefficients has at most q^k distinct zeros in K. We…

Planar functions are mappings from a finite field $\mathbb{F}_q$ to itself with an extremal differential property. Such functions give rise to finite projective planes and other combinatorial objects. There is a subtle difference between…

Let $f_1,\dots,f_m$ be polynomials in $n$ variables with coefficients in a finite field $\mathbb{F}_q$. We estimate the number of points $\underline{x}$ in $\mathbb{F}_q^n$ such that each value $f_i(\underline{x})$ is a nonzero square in…

We study an analogue of a classical arithmetic problem over the ring of polynomials. We prove that $m = 5$ is the minimal number such that the sums of any two distinct polynomials in a set of $m$ polynomials over $\F_2[x]$ cannot all be of…

Let k be a field of characteristic not 2, let q be a quadratic space over k and let f be an irreducible polynomial with coefficients in k. In 1969, Milnor raised the following question : how can we decide whether q has an isometry with…

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…