Related papers: Polynomial quotients: Interpolation, value sets an…
Let $f(x)\in \mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $\nu_p(q-1)\ge \nu_{p}(e)+\nu_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine…
We study the complexity of representing polynomials as a sum of products of polynomials in few variables. More precisely, we study representations of the form $$P = \sum_{i = 1}^T \prod_{j = 1}^d Q_{ij}$$ such that each $Q_{ij}$ is an…
Let $p$ be an odd prime number. Using modular arguments, we give an easy testable condition which allows often to prove Fermat's Last Theorem over the quadratic field ${\bf Q}(\sqrt{5})$ for the exponent $p$. It is related to the Wendt's…
For a polynomial $u=u(x)$ in $\mathbb{Z}[x]$ and $r\in\mathbb{Z}$, we consider the orbit of $u$ at $r$ denoted and defined by $\mathcal{O}_u(r):=\{u(r),u(u(r)),\ldots\}$. We ask two questions here: (i) what are the polynomials $u$ for which…
In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…
Let $m_{2}<m_{1}$ be two given nonnegative integers with $n=m_{1}+m_{2}+1$. For suitably differentiable $f$, we let $P,Q\in \pi_{n}$ be the Hermite polynomial interpolants to $f$ which satisfy $P^{(j)}(a)=f^{(j)}(a),j=0,1,...,m_{1}$ and…
A monic polynomial in F_q[t] of degree n over a finite field F_q of odd characteristic can be written as the sum of two irreducible monic elements in F_q[t] of degrees n and n-1 if q is larger than a bound depending only on n. The main tool…
We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be…
Let $f\in\Bbb F_q[X_1,\dots,X_n]$ with $\deg f=d>0$ and let $Z(f)=\{(x_1,\dots,x_n)\in \Bbb F_q^n: f(x_1,\dots,x_n)=0\}$. Ax's theorem states that $|Z(f)|\equiv 0\pmod {q^{\lceil n/d\rceil-1}}$, that is, $\nu_p(|Z(f)|)\ge m(\lceil…
We continue our study of the Widom factors for $L_p(\mu)$ extremal polynomials initiated in [4]. In this work we characterize sets for which the lower bounds obtained in [4] are saturated, establish continuity of the Widom factors with…
Let $q>2$ be a prime power and $f={\tt x}^{q-2}+t{\tt x}^{q^2-q-1}$, where $t\in\Bbb F_q^*$. It was recently conjectured that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following holds: (i) $t=1$, $q\equiv…
We state a general formula for the number of binomial coefficients $n$ choose $k$ that are divided by a fixed power of a prime $p$, i.e., the number of binomial coefficients divided by $p^j$ and not divided by $p^{j+1}$.
We present a generalization of Warning's Second Theorem to polynomial systems over a finite local principal ring with suitably restricted input and output variables. This generalizes a recent result with Forrow and Schmitt (and gives a new…
For $n \in \mathbb{N}$ let $\Pi[n]$ denote the set of partitions of $n$, i.e., the set of positive integer tuples $(x_1,x_2,\ldots,x_k)$ such that $x_1 \geq x_2 \geq \cdots \geq x_k$ and $x_1 + x_2 + \cdots + x_k = n$. Fixing…
Let $f(x)\in\mathbb{Z}[x]$ be a nonconstant polynomial. Let $n, k$ and $c$ be integers such that $n\ge 1$ and $k\ge 2$. An integer $a$ is called an $f$-exunit in the ring $\mathbb{Z}_n$ of residue classes modulo $n$ if $\gcd(f(a),n)=1$. In…
A fundamental challenge within the metric theory of continued fractions involves quantifying sets of real numbers, when represented using continued fractions, exhibit partial quotients that grow at specific rates. For any positive function…
Based on a new Taylor-like formula, we derived an improved interpolation error estimate in $W^{1,p}$. We compare it with the classical error estimates based on the standard Taylor formula, and also with the corresponding interpolation error…
Let $D$ be a subset of a finite commutative ring $R$ with identity. Let $f(x)\in R[x]$ be a polynomial of positive degree $d$. For integer $0\leq k \leq |D|$, we study the number $N_f(D,k,b)$ of $k$-subsets $S\subseteq D$ such that…
In this article an upper bound for the first consecutive zeros of the Fermat quotient is given in terms of the zeros of a Mirimanoff polynomial. This bound is obtained by investigating a relation between these polynomials and the factor…
Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. We prove an estimate for fractional parts of polynomials over $\mathbb{F}_q[t]$ satisfying a certain divisibility condition…