Representation of integers by sparse binary forms

DOI10.1090/TRAN/8241MaRDI QIDQ4963626zbMATH OpenOpenAlexFDO

Authors Shabnam Akhtari, Paloma Bengoechea

Publication date 19 February 2021

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.03705, http://hdl.handle.net/21.11116/0000-0007-ABE5-6

zbMATH Keywords

fewnomialsrational approximationsparse binary formsThue's inequalities

Mathematics Subject Classification ID

Counting solutions of Diophantine equations (11D45) Diophantine inequalities (11D75)

Abstract: We will give new upper bounds for the number of solutions to the inequalities of the shape $|F(x,y)|leqh$, where $F(x,y)$ is a sparse binary form, with integer coefficients, and $h$ is a sufficiently small integer in terms of the absolute value of the discriminant of the binary form $F$. Our bounds depend on the number of non-vanishing coefficients of $F(x,y)$. When $F$ is really sparse, we establish a sharp upper bound for the number of solutions that is linear in terms of the number of non-vanishing coefficients. This work will provide affirmative answers to a number of conjectures posed by Mueller and Schmidt in 1988, for special but important cases.

Recommendations

• On the representation of integers by binary forms
• On the representation of integers by binary forms
• Representation of small integers by binary forms
• scientific article; zbMATH DE number 1130562
• Number of representations of integers by binary forms
• scientific article; zbMATH DE number 3446980
• On representation of integers by binary quadratic forms
• Representation of integers by cyclotomic binary forms
• The number of representations of some positive integers by binary forms
• Sparsity of integer formulations for binary programs

Cites work

• A note on the equation $ax^n - by^n = c$
• An inequality for the discriminant of a polynomial
• COUNTING SOLUTIONS OF ∣ax^r–by^r∣≤h
• Decomposable form inequalities
• Die Gleichung ax^n-by^n=c
• Diophantine approximations and diophantine equations
• Finiteness Theorems for Binary Forms with Given Discriminant
• scientific article; zbMATH DE number 3784980 (Why is no real title available?)
• scientific article; zbMATH DE number 11133 (Why is no real title available?)
• scientific article; zbMATH DE number 140169 (Why is no real title available?)
• On the approximation of algebraic numbers. III: On the average numbers of representations of large numbers by binary forms
• On the Number of Solutions of Polynomial Congruences and Thue Equations
• On the representation of integers by binary forms
• On Thue inequalities and a conjecture of Schmidt
• On Thue's equation
• On two extremum properties of polynomials
• Rational approximation to algebraic numbers of small height: The Diophantine equation \(|ax^n-by^n|=1\)
• Representation of small integers by binary forms
• Thue Equations with Few Coefficients
• Thue inequalities with a small number of primitive solutions
• Thue's equation and a conjecture of Siegel
• Thue's inequalities and the hypergeometric method
• Trinomial Thue equations and inequalities.

Cited in

(4)

• Distribution results for low-weight binary representations for pairs of integers
• Diagonalizable Thue equations: revisited
• On sparsity of representations of polynomials as linear combinations of exponential functions
• The number of solutions to the trinomial Thue equation

This page was built for publication: Representation of integers by sparse binary forms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4963626)