Related papers: Splitting of integer polynomials over fields of pr…

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

In this paper we investigate the factorization behaviour of the binomial polynomials $\binom{x}{n} = \frac{x(x-1)\cdots (x-n+1)}{n!}$ and their powers in the ring of integer-valued polynomials $\operatorname{Int}(\mathbb{Z})$. While it is…

Let $\mathbb{F}_p$ be a finite field of size $p$ where $p$ is an odd prime. Let $f(x)\in\mathbb{F}_p[x]$ be a polynomial of positive degree $k$ that is not a $d$-th power in $\mathbb{F}_p[x]$ for all $d\mid p-1$. Furthermore, we require…

In the classical theory, a famous by-product of the continued fraction expansion of quadratic irrational numbers $\sqrt{D}$ is the solution to Pell's equation for $D$. It is well-known that, once an integer solution to Pell's equation…

We adapt the proof of the Green-Tao theorem on arithmetic progressions in primes to the setting of polynomials over a finite field, to show that for every $k$, the irreducible polynomials in $\mathbf{F}_q[t]$ contain configurations of the…

An irreducible polynomial over $\Bbb F_q$ is said to be normal over $\Bbb F_q$ if its roots are linearly independent over $\Bbb F_q$. We show that there is a polynomial $h_n(X_1,\dots,X_n)\in\Bbb Z[X_1,\dots,X_n]$, independent of $q$, such…

Carlitz proved that, for any prime power q other than 2, the group of all permutations of the finite field F_q is generated by the permutations induced by degree-one polynomials and x^{q-2}. His proof relies on a remarkable polynomial which…

Given a field $K$, a rational function $\phi \in K(x)$, and a point $b \in \mathbb{P}^1(K)$, we study the extension $K(\phi^{-\infty}(b))$ generated by the union over $n$ of all solutions to $\phi^n(x) = b$, where $\phi^n$ is the $n$th…

We prove that if a polynomial has a root mod $p$ for every large prime $p$, then it has a real root. As an application, we show that the primes can't be covered by finitely many positive definite binary quadratic forms.

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…

Let $X$ be a hypersurface in $\mathbb{P}^{4}$ of degree $d$ that has at most isolated ordinary double points. We prove that $X$ is factorial in the case when $X$ has at most $(d-1)^{2}-1$ singular points.

We show that every Dedekind domain $R$ lying between the polynomial rings $\mathbb Z[X]$ and $\mathbb Q[X]$ with the property that its residue fields of prime characteristic are finite fields is equal to a generalized ring of integer-valued…

Let $n\ge1$, $r\ge0$ and $s\ge0$ be integers satisfying $4+r+3 s\le3^{n+1}$. Given linear polynomials $f_{i}(x)=m_{i} x+n_{i}$ for $1 \le i \le r+s$, where the coefficients $m_{i} , n_{i}$ are positive integers satisfying certain…

Let $q$ be an odd prime power and $n$ be a positive integer. Let $\ell\in \mathbb F_{q^n}[x]$ be a $q$-linearised $t$-scattered polynomial of linearized degree $r$. Let $d=\max\{t,r\}$ be an odd prime number. In this paper we show that…

Let $F$ be a field, $p$ a prime number, $X$ an indeterminate over $F$, $D_n =F[X^{\frac{1}{p^n}}, X^{-\frac{1}{p^n}}]$ for each integer $n \geq 0$ and $D = \bigcup\limits_{n\in\mathbb{N}_0}D_n.$ Then $D$ is a one-dimensional B{\'e}zout…

It is proven that, in any given base, there are infinitely many palindromic numbers having at most six prime divisors, each relatively large. The work involves equidistribution estimates for the palindromes in residue classes to large…

Let $p>3$ and consider a prime power $q=p^h$. We completely characterize permutation polynomials of $\mathbb{F}_{q^2}$ of the type $f_{a,b}(X) = X(1 + aX^{q(q-1)} + bX^{2(q-1)}) \in \mathbb{F}_{q^2}[X]$. In particular, using connections…

We present a deterministic 2^O(t)q^{(t-2)(t-1)+o(1)} algorithm to decide whether a univariate polynomial f, with exactly t monomial terms and degree <q, has a root in F_q. A corollary of our method --- the first with complexity sub-linear…

Let $q$ be a prime power and $\mathbb{F}_q$ the finite field with $q$ elements. For a positive integer $n$, the binomial $X^n - 1 \in \mathbb{F}_q[X]$ is said to be $3$-sparse over $\mathbb{F}_q$ if every irreducible factor of $X^n-1$ in…

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be any linearly independent polynomials with zero constant term. We show that there exists a $\gamma>0$ such that any subset of $\mathbb{F}_q$ of size at least $q^{1-\gamma}$ contains a nontrivial…