Maximising the number of solutions to a linear equation in a set of integers

DOI10.1112/blms.12253zbMath1443.11210arXiv1801.07135OpenAlexW3100990763MaRDI QIDQ5237339

James Aaronson

Publication date: 17 October 2019

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

number of solutionslinear Diophantine equation

Mathematics Subject Classification ID

Linear Diophantine equations (11D04) Inverse problems of additive number theory, including sumsets (11P70)

Related Items (1)

The maximal number of 3-term arithmetic progressions in finite sets in different geometries

Cites Work

• Unnamed Item
• Growth polynomials for additive quadruples and \((h,k)\)-tuples
• On the number of solutions of a linear equation over finite sets
• Sums of Dilates
• The Rearrangement of Positive Fourier Coefficients
• Solving a±b=2c in elements of finite sets
• On the maximal number of 3-term arithmetic progressions in subsets of ℤ/p ℤ
• Some remarkable properties of sinc and related integrals

This page was built for publication: Maximising the number of solutions to a linear equation in a set of integers