Power savings for counting solutions to polynomial-factorial equations
From MaRDI portal
Publication:2700635
DOI10.1016/j.aim.2023.109021OpenAlexW4365520294MaRDI QIDQ2700635
Alexandru Zaharescu, Kyle Pratt, Hung Manh Bui
Publication date: 27 April 2023
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.08423
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Squares and factorials in products of factorials
- On Siegel's lemma
- On the method of Thue-Siegel
- Product type bounds on the approximation of values of E- and G-functions
- On the equation \(P(x)=n!\) and a question of Erdős
- On the Brocard-Ramanujan Diophantine equation \(n! + 1 = m^2\)
- Transcendental numbers. With a foreword by W. Dale Brownawell. Transl. from the Russian by Neal Koblitz
- On the finiteness of solutions for polynomial-factorial Diophantine equations
- Diophantine equations involving the Euler totient function
- Rational approximation to algebraic numbers of small height: the Diophantine equation |axn - byn|= 1
- SOME OBSERVATIONS ON THE DIOPHANTINE EQUATION y2=x!+A AND RELATED RESULTS
- Simultaneous rational approximations and related diophantine equations
- The Diophantine Equation n ! + 1 = m2
- The next to last case of a factorial diophantine equation
- Rational approximations to linear forms in values of G-functions
- On factorials which are products of factorials
- Irrationality via the Hypergeometric method
- On polynomial-factorial diophantine equations
- Transcendental Numbers. (AM-16)
This page was built for publication: Power savings for counting solutions to polynomial-factorial equations