Related papers: Counting Polynomials with Distinct Zeros in Finite…
We estimate the average cardinality $\mathcal{V}(\mathcal{A})$ of the value set of a general family $\mathcal{A}$ of monic univariate polynomials of degree $d$ with coefficients in the finite field $\mathbb{F}_{\hskip-0.7mm q}$. We…
Let $f_{1}, \ldots, f_{k}$ be polynomials defining an algebraic set in affine $n$-space over a finite field. Suppose $k>n$. We prove that there exists a system of polynomials $g_{1}, \ldots, g_{n}$, each being a linear combination with…
The van der Waerden's Conjecture states that the set $\mathscr{P}_{n,N}^0(\mathbb{Q})$ of monic integer polynomials $f(X)$ of degree $n$, with height $\le N$ such that the Galois group $G_{K_f/\mathbb{Q}}$ of the splitting field…
Let $p$ be a prime, and $N$ be a positive integer not divisible by $p$. Denote by ${\rm ord}_N(p)$ the multiplicative order of $p$ modulo $N$. Let $\mathbb{F}_q$ represent the finite field of order $q=p^{{\rm ord}_N(p)}$. For $a,…
Let $q$ be a prime power. We estimate the number of tuples of degree bounded monic polynomials $(Q_1,\ldots,Q_v) \in (\mathbb{F}_q[z])^v$ that satisfy given pairwise coprimality conditions. We show how this generalises from monic…
The smallest possible number of distinct eigenvalues of a graph $G$, denoted by $q(G)$, has a combinatorial bound in terms of unique shortest paths in the graph. In particular, $q(G)$ is bounded below by $k$, where $k$ is the number of…
Let ${\mathcal B}=\{b_i \}_{i=1}^\infty$ be a fixed sequence of pairwise distinct elements of a number field $k$. Given the integers $2\leq s \leq r$, assuming a quantitative version of Vojta's conjecture on the bounded degree algebraic…
Consider a quartic number field $K$ generated by a root of an irreducible quadrinomial of the form $ F(x)= x^4+ax^3+bx+c \in \Z[x]$. Let $i(K)$ denote the index of $K$. Engstrom \cite{Engstrom} established that $i(K)=2^u \cdot 3^v$ with $u…
In this note we prove that certain polynomial mappings $P_\mathfrak{g}^k(\mathbf{x}) \in \mathbf{Z}[\mathbf{x}]$ in $n$-variables obtained from simple complex Lie algebras $\mathfrak{g}$ of arbitrary rank $n \ge 1$, are exceptional.
We prove new combinatorial results about polynomial configurations in large subsets of finite fields. Bergelson--Leibman--McCutcheon (2005) showed that for any polynomial $P(x) \in \mathbb{Z}[x]$ with $P(0) = 0$, if $A \subseteq…
We consider the set of monic degree $d$ real univariate polynomials $Q_d=x^d+\sum_{j=0}^{d-1}a_jx^j$ and its {\em hyperbolicity domain} $\Pi_d$, i.e. the subset of values of the coefficients $a_j$ for which the polynomial $Q_d$ has all…
Let $f(x)$ be a monic polynomial in $\dZ[x]$ with no rational roots but with roots in $\dQ_p$ for all $p$, or equivalently, with roots mod $n$ for all $n$. It is known that $f(x)$ cannot be irreducible but can be a product of two or more…
For an odd prime $p$, we say a polynomial $f\in \mathbb F_p[X]$ computes square roots if $f(a)^2=a$ for all nonzero, perfect squares $a\in \mathbb F_p$. When $p\equiv 3 \mod 4$, it is easy to see that $f(X)=X^{\frac{p+1}{4}}$ is the…
Let $e$ be a positive integer, $p$ be an odd prime, $q=p^{e}$, and $\Bbb F_q$ be the finite field of $q$ elements. Let $f,g \in \Bbb F_q [X,Y]$. The graph $G=G_q(f,g)$ is a bipartite graph with vertex partitions $P=\Bbb F_q^3$ and $L=\Bbb…
We provide an easy method for the construction of characteristic polynomials of simple ordinary abelian varieties ${\mathcal A}$ of dimension $g$ over a finite field ${\mathbb F}_q$, when $q\ge 4$ and $2g=\rho^{b-1}(\rho-1)$ for some prime…
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…
We use Grothendieck's dessins d'enfant to show that if $P$ and $Q$ are two real polynomials, any real function of the form $x^\alpha(1-x)^{\beta} P - Q$, has at most $\deg P +\deg Q + 2$ roots in the interval $]0,~1[$. As a consequence, we…
A weighted bicolored plane tree is a bicolored plane tree whose edges are endowed with positive integral weights. The degree of a vertex is defined as the sum of the weights of the edges incident to this vertex. Using the theory of dessins…
Let $F$ be a homogeneous polynomial of degree $d$ in $m+1$ variables defined over an algebraically closed field of characteristic 0 and suppose that $F$ belongs to the $s$-th secant variety of the $d$-uple Veronese embedding of…
In an earlier work, the authors have determined all possible weights $n$ for which there exists a vanishing sum $\zeta_1+\cdots +\zeta_n=0$ of $m$th roots of unity $\zeta_i$ in characteristic 0. In this paper, the same problem is studied in…