Related papers: Pillai's conjecture for polynomials

In this paper we prove that the PDE $p(D)f=q,$ where $p$ and $q$ are multivariate polynomials, has a solution in the space of polynomials of total degree not exceeding ${n+s},$ where $n$ is the degree of $q$ and $s$ is the zero order of…

We prove Sylvester-Gallai type theorems for quadratic polynomials. Specifically, we prove that if a finite collection $\mathcal Q$, of irreducible polynomials of degree at most $2$, satisfy that for every two polynomials $Q_1,Q_2\in…

We consider incomplete exponential sums in several variables of the form S(f,n,m) = \frac{1}{2^n} \sum_{x_1 \in \{-1,1\}} ... \sum_{x_n \in \{-1,1\}} x_1 ... x_n e^{2\pi i f(x)/p}, where m>1 is odd and f is a polynomial of degree d with…

We obtain a combinatorial proof that the number of points of the space $\overline{{\mathcal M}_{0,n}}({\mathbb F}_q)$ satisfies the recurrent formula for Poincare polynomials of the space $\overline{{\mathcal M}_{0,n}}({\mathbb C})$.

In this work, we extend the robust version of the Sylvester-Gallai theorem, obtained by Barak, Dvir, Wigderson and Yehudayoff, and by Dvir, Saraf and Wigderson, to the case of quadratic polynomials. Specifically, we prove that if…

For any given positive definite binary quadratic form $Q$ with integer coefficients, we establish two results on Diophantine approximation with integers represented by $Q$. Firstly, we show that for every irrational number $\alpha$, there…

Consider the equation $q_1\alpha^{x_1}+\dots+q_k\alpha^{x_k} = q$, with constants $\alpha \in \overline{\mathbb{Q}} \setminus \{0,1\}$, $q_1,\ldots,q_k,q\in\overline{\mathbb{Q}}$ and unknowns $x_1,\ldots,x_k$, referred to in this paper as…

In 1876 Brocard, and independently in 1913 Ramanujan, asked to find all integer solutions for the equation $n!=x^2-1$. It is conjectured that this equation has only three solutions, but up to now this is an open problem. Overholt observed…

Let f(1)=1, and let f(n+1)=2^{2^{f(n)}} for every positive integer n. We conjecture that if a system S \subseteq {x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} \cup {x_i+1=x_k: i,k \in {1,...,n}} has only finitely many solutions in non-negative…

Let $F\in\mathbb{Z}[x,y]$ and $m\ge2$ be an integer. A set $A\subset \mathbb{Z}$ is called an $(F,m)$-Diophantine set if $F(a,b)$ is a perfect $m$-power for any $a,b\in A$ where $a\ne b$. If $F$ is a bivariate polynomial for which there…

A number of authors have proven explicit versions of Lehmer's conjecture for polynomials whose coefficients are all congruent to 1 modulo m. We prove a similar result for polynomials f(X) that are divisible in (Z/mZ)[X] by a polynomial of…

In this paper, we have characterized the nature and form of solutions of the following non-linear delay-differential equation: $$f^{n}(z)+\sum_{i=1}^{n-1}b_{i}f^{i}(z)+q(z)e^{Q(z)}L(z,f)=P(z),$$ where $b_i\in\mathbb{C}$, $L(z,f)$ be a…

In this paper we consider Diophantine equations of the form $f(x)=g(y)$ where $f$ has simple rational roots and $g$ has rational coefficients. We give strict conditions for the cases where the equation has infinitely many solutions in…

We prove the following statement. Let $f\in\mathbb{R}[x_1,\ldots,x_d]$, for some $d\ge 3$, and assume that $f$ depends non-trivially in each of $x_1,\ldots,x_d$. Then one of the following holds. (i) For every finite sets…

For a fixed quadratic irreducible polynomial $f$ with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes $p$ such that $f(p)$ has at most 4 prime factors, improving a classical result of Richert who…

We conjecture that if a system S \subseteq {x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in integers x_1,...,x_n, then each such solution (x_1,...,x_n) satisfies |x_1|,...,|x_n| \leq…

We prove Dirichlet's theorem for polynomial rings: Let F be a pseudo algebraically closed field. Then for all relatively prime polynomials a(X), b(X)\in F[X] and for every sufficiently large positive integer n there exist infinitely many…

One of the most interesting results of the last century was the proof completed by Matijasevich that computably enumerable sets are precisely the diophantine sets [MRDP Theorem, 9], thus settling, based on previously developed machinery,…

Given a monotonically decreasing $\psi: \mathbb{N} \to [0,\infty)$, Khintchine's Theorem provides an efficient tool to decide whether, for almost every $\alpha \in \mathbb{R}$, there are infinitely many $(p,q) \in \mathbb{Z}^2$ such that…

In this paper we prove that assuming Schanuel's conjecture, an exponential polynomial in one variable over the algebraic numbers has only finitely many algebraic solutions. This implies a positive answer to Shapiro's conjecture for…