Forbidden arithmetic progressions in permutations of subsets of the integers
From MaRDI portal
Abstract: Permutations of the positive integers avoiding arithmetic progressions of length were constructed in (Davis et al, 1977), implying the existence of permutations of the integers avoiding arithmetic progressions of length . We construct a permutation of the integers avoiding arithmetic progressions of length . We also prove a lower bound of on the lower density of subsets of positive integers that can be permuted to avoid arithmetic progressions of length , sharpening the lower bound of from (LeSaulnier and Vijay, 2011). In addition, we generalize several results about forbidden arithmetic progressions to construct permutations avoiding generalized arithmetic progressions.
Recommendations
Cites work
Cited in
(8)- Arithmetic subsequences in a random ordering of an additive set
- The Forbidden Set of
- Postscript: ``Permutations with forbidden subsequences and a generalized Schröder number [Discrete Mathematics 218 (2000) 121--130]
- Avoiding monotone arithmetic progressions in permutations of integers
- On a conjecture regarding permutations which destroy arithmetic progressions
- A note on 3-free permutations
- On permutations avoiding arithmetic progressions
- Arithmetic progressions in permutations
This page was built for publication: Forbidden arithmetic progressions in permutations of subsets of the integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1732783)