LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Representation of integers by sparse binary forms

Photo from academic.microsoft.com

We will give new upper bounds for the number of solutions to the inequalities of the shape $|F(x , y)| \leq h$, where $F(x , y)$ is a sparse binary… Click to show full abstract

We will give new upper bounds for the number of solutions to the inequalities of the shape $|F(x , y)| \leq h$, 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.

Keywords: number; binary forms; sparse binary; representation integers; integers sparse

Journal Title: Transactions of the American Mathematical Society
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.