On partitioning integers into progression free sets

DOI10.1016/0097-3165(72)90076-3zbMath0283.05004OpenAlexW2009090807MaRDI QIDQ1844233

Yanyan Li

Publication date: 1972

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

Full work available at URL: https://doi.org/10.1016/0097-3165(72)90076-3

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Elementary theory of partitions (11P81) Special sequences and polynomials (11B83)

Related Items (1)

Puncture sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two combinatorial theorems on arithmetic progressions
• Notes on Number Theory II : On a theorem of van der Waerden
• A Construction for Partitions Which Avoid Long Arithmetic Progressions
• On sets of integers containing no four elements in arithmetic progression
• Combinatorial Theorems on Classifications of Subsets of a Given Set
• On Non-Averaging Sets of Integers
• On a Problem of Additive Number Theory
• Zur Verteilung natürlicher Zahlen auf elementfremde Klassen
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression

This page was built for publication: On partitioning integers into progression free sets