Avoiding Monotone Arithmetic Progressions in Permutations of Integers
Sarosh Adenwalla

TL;DR
This paper advances the study of permutations avoiding monotone arithmetic progressions by constructing longer progression-free permutations, improving density bounds, and generalizing previous results for specific progression lengths and differences.
Contribution
It constructs permutations avoiding longer monotone arithmetic progressions, improves density bounds, and generalizes previous results on differences and modular conditions.
Findings
Constructed permutations avoiding length 5 progressions of integers.
Improved upper and lower density results for certain permutations.
Generalized avoidance results for progressions with specific differences.
Abstract
A permutation of the integers avoiding monotone arithmetic progressions of length was constructed in (Geneson, 2018). We improve on this by constructing a permutation of the integers avoiding monotone arithmetic progressions of length . We also construct permutations of the integers and the positive integers that improve on previous upper and lower density results. In (Davis et al. 1977) they constructed a doubly infinite permutation of the positive integers that avoids monotone arithmetic progressions of length . We construct a doubly infinite permutation of the integers avoiding monotone arithmetic progressions of length . A permutation of the positive integers that avoided monotone arithmetic progressions of length with odd common difference was constructed in (LeSaulnier and Vijay, 2011). We generalise this result and show that for each , there exists a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography
