English
Related papers

Related papers: Polynomial exponential equations and Zilber's conj…

200 papers

Building on work of Davenport and Schmidt, we mainly prove two results. The first one is a version of Gel'fond's transcendence criterion which provides a sufficient condition for a complex or $p$-adic number $\xi$ to be algebraic in terms…

Number Theory · Mathematics 2007-05-23 Damien Roy , Michel Waldschmidt

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…

Number Theory · Mathematics 2010-08-24 Joseph H. Silverman

A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…

High Energy Physics - Theory · Physics 2009-10-22 A. Turbiner

A key property of an algebraic variety is whether it is absolutely irreducible, meaning that it remains irreducible over the algebraic closure of its defining field, and determining absolute irreducibility is important in algebraic geometry…

Algebraic Geometry · Mathematics 2026-02-03 Carlos Agrinsoni , Heeralal Janwa , Moises Delgado

We construct two new exactly solvable potentials giving rise to bound-state solutions to the Schr\"odinger equation, which can be written in terms of the recently introduced Laguerre- or Jacobi-type $X_1$ exceptional orthogonal polynomials.…

Quantum Physics · Physics 2009-11-13 C. Quesne

Zilber's Exponential Algebraic Closedness conjecture (also known as Zilber's Nullstellensatz) gives conditions under which a complex algebraic variety should intersect the graph of the exponential map of a semiabelian variety. We prove the…

Complex Variables · Mathematics 2024-01-24 Vahagn Aslanyan , Jonathan Kirby , Vincenzo Mantova

For R(z, w) rational with complex coefficients, of degree at least 2 in w, we show that the number of rational functions f(z) solving the difference equation f(z+1)=R(z, f(z)) is finite and bounded just in terms of the degrees of R in the…

Number Theory · Mathematics 2021-01-25 Patrick Ingram

In this paper, we recast a special case of Mahler'c conjecture by the maximum value of box splines. This is the case of polytopes with at most $2n+2$ facets. An asymptotic formula for univariate box splines is given. Based on the formula,…

Metric Geometry · Mathematics 2009-01-06 Zhiqiang Xu

We reconsider the conjecture by Gepner that the fusion ring of a rational conformal field theory is isomorphic to a ring of polynomials in $n$ variables quotiented by an ideal of constraints that derive from a potential. We show that in a…

High Energy Physics - Theory · Physics 2009-10-22 P. Di Francesco , J. -B. Zuber

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…

Number Theory · Mathematics 2014-10-21 Apoloniusz Tyszka

In order to have a multiresolution analysis, the scaling function must be refinable. That is, it must be the linear combination of 2-dilation, $\mathbb{Z}$-translates of itself. Refinable functions used in connection with wavelets are…

Information Theory · Computer Science 2011-11-02 Emily J. King

Boelen et al. (2010) deduced a $q$-discrete Painlev\'e equation satisfied by the recurrence coefficients of orthogonal polynomials and conjectured that the equation had a unique positive solution. We prove their conjecture and discuss…

Classical Analysis and ODEs · Mathematics 2021-10-18 Tomas Lasic Latimer

We study one-variable equations over the lamplighter group $\MZ_2 \wr \MZ$. While the decidability of arbitrary equations over $L_2$ remains open, we prove that the Diophantine problem for single equations in one variable is decidable. Our…

Group Theory · Mathematics 2026-01-21 Alexander Ushakov , Yankun Wang

An old conjecture of Erd\H{o}s and R\'enyi, proved by Schinzel, predicted a bound for the number of terms of a polynomial $g(x) \in \mathbb{C}[x]$ when its square $g(x)^2$ has a given number of terms. Further conjectures and results arose,…

Number Theory · Mathematics 2024-01-24 Clemens Fuchs , Vincenzo Mantova , Umberto Zannier

For a field $E$ of characteristic different from $2$ and cohomological $2$-dimension one, quadratic forms over the rational function field $E(X)$ are studied. A characterisation in terms of polynomials in $E[X]$ is obtained for having that…

Commutative Algebra · Mathematics 2021-07-16 Karim Johannes Becher , Parul Gupta

It is conjectured that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive integers $x,y$ and $z$, except for specific cases. In this…

Number Theory · Mathematics 2025-04-15 Maohua Le , Takafumi Miyazaki

In this paper, we will give suitable conditions on differential polynomials $Q(f)$ such that they take every finite non-zero value infinitely often, where $f$ is a meromorphic function in complex plane. These results are related to Problem…

Complex Variables · Mathematics 2020-03-20 Ta Thi Hoai An , Nguyen Viet Phuong

This paper presents a proof that existence of a polynomial Lyapunov function is necessary and sufficient for exponential stability of sufficiently smooth nonlinear ordinary differential equations on bounded sets. The main result states that…

Classical Analysis and ODEs · Mathematics 2007-08-25 Matthew M. Peet

Assume that the Riemann hypothesis holds for Dedekind zeta functions. Under this assumption, we prove that a degree $d$ polynomial with random multiplicative $\pm1$ coefficients is irreducible in $\mathbb{Z}[x]$ with probability…

Number Theory · Mathematics 2025-11-07 Péter P. Varjú , Max Wenqiang Xu

In 2007, Dmytrenko, Lazebnik and Williford posed two related conjectures about polynomials over finite fields. Conjecture~1 is a claim about the uniqueness of certain monomial graphs. Conjecture~2, which implies Conjecture~1, deals with…

Combinatorics · Mathematics 2017-01-20 Xiang-dong Hou