Related papers: Effective Khovanskii, Ehrhart Polytopes, and the E…

For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…

D. Dimitrov has posed the problem of finding polynomials that set the sharpness of the Koebe Quarter Theorem for polynomials and asked whether Suffridge polynomials are optimal. We disprove Dimitrov's conjecture for polynomials of degree 3,…

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Let $a,b\in \mathbb{N}$ be fixed and coprime such that $a>b$, and let $N$ be any number of the form $a^n\pm b^n$, $n\in\mathbb{N}$. We will generalize a result of Bostan, Gaudry and Schost and prove that we may compute the prime…

Let $q_n$ denote the $n^{th}$ number that is a product of exactly two distinct primes. We prove that $$\liminf_{n\to \infty} (q_{n+1}-q_n) \le 6.$$ This sharpens an earlier result of the authors (arXivMath NT/0506067), which had 26 in place…

Let $P$ be a polynomial with integer coefficients and degree at least two. We prove an upper bound on the number of integer solutions $n\leq N$ to $n! = P(x)$ which yields a power saving over the trivial bound. In particular, this applies…

We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…

Diaconis and Griffiths (2014) study the multivariate Krawtchouk polynomials orthogonal on the multinomial distribution. In this paper we derive the reproducing kernel orthogonal polynomials Q_n(x,y};N,p) on the multinomial distribution…

For a natural number $k>1$, let $f_k(n)$ denote the number of distinct representations of a natural number $n$ of the form $p^k+q^k$ for primes $p,q$. We prove that, for all $k>1$, $$\limsup_{n\to\infty}f_k(n)=\infty.$$ This positively…

Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…

We show the existence of systems of n polynomial equations in n variables, with a total of n+k+1 distinct monomial terms, possessing [n/k+1]^k nondegenerate positive solutions. (Here, [x] is the integer part of a positive number x.) This…

We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial…

In the theory of orthogonal polynomials, as well as in its intersection with harmonic analysis, it is an important problem to decide whether a given orthogonal polynomial sequence $(P_n(x))_{n\in\mathbb{N}_0}$ satisfies nonnegative…

We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…

We prove Odoni's conjecture in all prime degrees; namely, we prove that for every positive prime $p$, there exists a degree $p$ polynomial $\varphi\in\mathbb{Z}[x]$ with surjective arboreal Galois representation. We also show that Vojta's…

In this follow-up paper, we again inspect a surprising connection between the set of fixed points of a polynomial map $\varphi_{d,c}$ defined by $\varphi_{d,c}(z) = z^d + c$ for all $c, z \in \mathcal{O}_{K}$ and the coefficient $c$, where…

An integer $k$ is called regular (mod $n$) if there exists an integer $x$ such that $k^2x\equiv k$ (mod $n$). This holds true if and only if $k$ possesses a weak order (mod $n$), i.e., there is an integer $m\ge 1$ such that $k^{m+1} \equiv…

In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for…

We prove a conjecture of Bonamy, Bousquet, Pilipczuk, Rz\k{a}\.zewski, Thomass\'e, and Walczak, that for every graph $H$, there is a polynomial $p$ such that for every positive integer $s$, every graph of average degree at least $p(s)$…

Let n and d be positive integers, let k be a field and let P(n,d;k) be the space of the polynomials in n variables of degree at most d with coefficients in k. Let B(n,d) be the set of the Bernstein-Sato polynomials of all polynomials in…