On permutations containing no long arithmetic progressions

DOI10.4064/AA-34-1-81-90MaRDI QIDQ4090434zbMATH OpenOpenAlexWikidataFDO

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

Publication date 1977

Published in Acta Arithmetica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

Special sequences and polynomials (11B83)

Cited in

(15)

• On the infinite permutation generated by the period doubling word
• On an infinite permutation similar to the Thue-Morse word
• Mathematical problems and games
• Forbidden arithmetic progressions in permutations of subsets of the integers
• Quasirandom permutations
• Well ordering groups with no monotone arithmetic progressions
• On periodicity and low complexity of infinite permutations
• On automatic infinite permutations
• Arithmetic subsequences in a random ordering of an additive set
• A note on 3-free permutations
• On permutations avoiding arithmetic progressions
• Avoiding monotone arithmetic progressions in permutations of integers
• Characterization of order structures avoiding three-term arithmetic progressions
• 3AP-free permutations have no exponential growth rate
• 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)