Enumerating permutations that avoid three term arithmetic progressions (Q1028844)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Enumerating permutations that avoid three term arithmetic progressions |
scientific article; zbMATH DE number 5576444
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumerating permutations that avoid three term arithmetic progressions |
scientific article; zbMATH DE number 5576444 |
Statements
Enumerating permutations that avoid three term arithmetic progressions (English)
0 references
8 July 2009
0 references
Summary: It is proved that the number of permutations of the set \(\{1, 2, 3, \dots, n\}\) that avoid three term arithmetic progressions is at most \(\frac{(2.7)^n}{21}\) for \(n \geq 11\) and at each end of any such permutation, at least \(\lfloor \frac{n}{2} \rfloor - 6\) entries have the same parity.
0 references
permutations avoiding three-term arithmetic progressions
0 references
0.92700446
0 references
0.90620196
0 references
0 references
0.90501034
0 references
0.8964207
0 references
0.8952793
0 references
0.89233905
0 references
0.8908219
0 references
0.8903817
0 references
