On permutations containing no long arithmetic progressions

DOI10.4064/AA-34-1-81-90zbMATH Open0326.10045OpenAlexW1005731694WikidataQ105989316 ScholiaQ105989316MaRDI QIDQ4090434FDOQ4090434

Ron Graham, R. C. Entringer, James A. Davis, Gustavus J. Simmons

Publication date: 1977

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/205594

Mathematics Subject Classification ID

Special sequences and polynomials (11B83)

Cited In (13)

• Arithmetic subsequences in a random ordering of an additive set
• On automatic infinite permutations
• A Note on 3-free Permutations
• Forbidden arithmetic progressions in permutations of subsets of the integers
• Avoiding monotone arithmetic progressions in permutations of integers
• On the infinite permutation generated by the period doubling word
• On an infinite permutation similar to the Thue-Morse word
• Quasirandom permutations
• Mathematical problems and games
• On periodicity and low complexity of infinite permutations
• On permutations avoiding arithmetic progressions
• Well ordering groups with no monotone arithmetic progressions
• Permutations destroying arithmetic progressions in finite cyclic groups

This page was built for publication: On permutations containing no long arithmetic progressions

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