Related papers: Polynomial exponential equations and Zilber's conj…
We study the Diophantine equations obtained by equating a polynomial and the factorial function, and prove the finiteness of integer solutions under certain conditions. For example, we show that there exists only finitely many $l$ such that…
Polynomial Systems, or at least their algorithms, have the reputation of being doubly-exponential in the number of variables [Mayr and Mayer, 1982], [Davenport and Heintz, 1988]. Nevertheless, the Bezout bound tells us that that number of…
In this paper we study the polynomial version of Pillai's conjecture on the exponential Diophantine equation \begin{equation*} p^n - q^m = f. \end{equation*} We prove that for any non-constant polynomial $ f $ there are only finitely many…
We give a brief history of transcendental number theory, including Schanuel's conjecture (S). Assuming (S), we prove that if z and w are complex numbers, not 0 or 1, with z^w and w^z algebraic, then z and w are either both rational or both…
The Schinzel Hypothesis is a conjecture about irreducible polynomials in one variable over the integers: under some standard condition, they should assume infinitely many prime values at integers. We consider a relative version: if the…
The Casas-Alvero conjecture predicts that every univariate polynomial over an algebraically closed field of characteristic zero sharing a common factor with each of its Hasse-Schmidt derivatives is a power of a linear polynomial. The…
The Schinzel hypothesis is a famous conjectural statement about primes in value sets of polynomials, which generalizes the Dirichlet theorem about primes in an arithmetic progression. We consider the situation that the ring of integers is…
We prove the Existential Closedness conjecture for the differential equation of the $j$-function and its derivatives. It states that in a differentially closed field certain equations involving the differential equation of the $j$-function…
Generalizing an argument of Matiyasevich, we illustrate a method to generate infinitely many diophantine equations whose solutions can be completely described by linear recurrences. In particular, we provide an integer-coefficient…
We give a construction of quasiminimal fields equipped with pseudo-analytic maps, generalising Zilber's pseudo-exponential function. In particular we construct pseudo-exponential maps of simple abelian varieties, including…
In this paper, we show the existence of a transcendental function $f\in\mathbb{Z}\{z\}$ with coefficients that are almost all bounded such that $f$ and all its derivatives assume algebraic values at algebraic points. Furthermore, we…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
We adapt ideas of Phong, Stein and Sturm and ideas of Ikromov and M\"uller from the continuous setting to various discrete settings, obtaining sharp bounds for exponential sums and the number of solutions to polynomial congruences for…
We consider a variety of Euler's conjecture, i.e., whether the Diophantine system \[\begin{cases} n=a_{1}+a_{2}+\cdots+a_{s-1}, a_{1}a_{2}\cdots a_{s-1}(a_{1}+a_{2}+\cdots+a_{s-1})=b^{s} \end{cases}\] has solutions…
We produce an infinite family of transcendental numbers which, when raised to their own power, become rational. We extend the method, to investigate positive rational solutions to the equation $x^x = \alpha$, where $\alpha$ is a fixed…
The paper [GLZ] "L-functions of Carlitz modules, resultantal varieties and rooted binary trees" is devoted to a description of some resultantal varieties related to L-functions of Carlitz modules. It contains a conjecture that some of these…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
According to Skolem's conjecture, if an exponential Diophantine equation is not solvable, then it is not solvable modulo an appropriately chosen modulus. Besides several concrete equations, the conjecture has only been proved for rather…
Erd\"os and Obl\'ath proved that the equation $n!\pm m!=x^p$ has only finitely many integer solutions. More general, under the ABC-conjecture, Luca showed that $P(x)=An!+Bm!$ has finitely many integer solutions for polynomials of degree…
Assuming Schanuel's conjecture, we prove that the complete theory $T_{\exp}$ of the real exponential field is axiomatized by the axioms of definably complete exponential fields satisfying $\exp' = \exp$. This implies the result of Macintyre…