On the number of solutions of a linear equation over finite sets

DOI10.1006/jcta.1998.2878zbMath0907.11009OpenAlexW2039993732MaRDI QIDQ1269894

Vsevolod F. Lev

Publication date: 2 March 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1998.2878

zbMATH Keywords

arithmetic progressionslinear diophantine equations over finite sets

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Linear Diophantine equations (11D04)

Related Items (3)

The anti-Ramsey problem for the Sidon equation ⋮ Maximising the number of solutions to a linear equation in a set of integers ⋮ Linear equations over \(\mathbb F_ p\) and moments of exponential sums.

Cites Work

• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• The Rearrangement of Positive Fourier Coefficients
• Solution of Two Difficult Combinatorial Problems with Linear Algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of solutions of a linear equation over finite sets