On finite pattern-free sets of integers

DOI10.4064/AA121-4-2MaRDI QIDQ5478108zbMATH OpenOpenAlexFDO

Authors Karl Dilcher, Lutz G. Lucht

Publication date 30 June 2006

Published in Acta Arithmetica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4064/aa121-4-2

zbMATH Keywords

configurationslinear equations

Mathematics Subject Classification ID

Other combinatorial number theory (11B75)

Recommendations

• scientific article; zbMATH DE number 5138745
• On sets of natural numbers without solution to a noninvariant linear equation
• scientific article; zbMATH DE number 409908
• Patterns without a popular difference
• On solution-free sets of integers

Cited in

(12)

• Maximal sets with no solution to x+y=3z
• On solution-free sets of integers
• Finite analogs of Szemerédi's theorem
• Patterns without a popular difference
• scientific article; zbMATH DE number 5138745 (Why is no real title available?)
• scientific article; zbMATH DE number 5707534 (Why is no real title available?)
• scientific article; zbMATH DE number 1996332 (Why is no real title available?)
• scientific article; zbMATH DE number 5547 (Why is no real title available?)
• Enumerating solution-free sets in the integers
• On the asymptotic maximal density of a set avoiding solutions to linear equations modulo a prime
• Character-free approach to progression-free sets
• Predicates whose maximal length functions increase periodically

This page was built for publication: On finite pattern-free sets of integers

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