Solution-free sets for sums of binary forms

DOI10.1112/PLMS/PDS083MaRDI QIDQ2843972zbMATH OpenOpenAlexFDO

Authors Sean M. Prendiville

Publication date 27 August 2013

Published in Proceedings of the London Mathematical Society. Third Series (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1110.1999

zbMATH Keywords

arithmetic progressionbinary forminteger latticeRoth's theoremVinogradov's mean value theorem

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Counting solutions of Diophantine equations (11D45) Diophantine equations in many variables (11D72) Estimates on exponential sums (11L07) Weyl sums (11L15) Applications of the Hardy-Littlewood method (11P55)

Abstract: We obtain quantitative estimates for the asymptotic density of subsets of the two-dimensional integer lattice which contain only trivial solutions to an additive equation involving binary forms. In the process we develop an analogue of Vinogradov's mean value theorem applicable to binary forms.

Recommendations

• Density of integer solutions to diagonal quadratic forms
• The addition of binary cubic forms
• scientific article; zbMATH DE number 1130562
• On solution-free sets for simultaneous quadratic and linear equations
• Solving a linear equation in a set of integers II

Cited in

(3)

• Decoupling for moment manifolds associated to Arkhipov-Chubarikov-Karatsuba systems
• Near-optimal mean value estimates for multidimensional Weyl sums
• Binary quadratic forms in difference sets

This page was built for publication: Solution-free sets for sums of binary forms

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