Small Sets which meet all the n -Term Arithmetic Progressions in the Interval [1, n2 ]

DOI10.1112/BLMS/23.2.123MaRDI QIDQ4012797zbMATH OpenOpenAlexFDO

Authors John K. Truss

Publication date 27 September 1992

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

Full work available at URL https://doi.org/10.1112/blms/23.2.123

zbMATH Keywords

arithmetic progressionssmall sets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Arithmetic progressions (11B25) Other combinatorial number theory (11B75)

Recommendations

• Small sets which meet all the k(n)-term arithmetic progressions in the interval [1,n]
• Arithmetic progressions in subset sums
• Arithmetical progressions and the number of sums
• Sets without k‐term progressions can have many shorter progressions
• On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions

Cited in

(3)

• Small sets which meet all the k(n)-term arithmetic progressions in the interval [1,n]
• On sets without k-term arithmetic progression
• A generalization of sets without long arithmetic progressions based on Szekeres algorithm

This page was built for publication: Small Sets which meet all the n -Term Arithmetic Progressions in the Interval [1, n² ]

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