On permutations containing no long arithmetic progressions

DOI10.4064/aa-34-1-81-90zbMath0326.10045OpenAlexW1005731694WikidataQ105989316 ScholiaQ105989316MaRDI QIDQ4090434

Roger Entringer, James A. Davis, Gustavus J. Simmons, Ronald L. Graham

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)

Related Items (12)

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

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