Enumerating permutations that avoid three term arithmetic progressions (Q1028844): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:16, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumerating permutations that avoid three term arithmetic progressions |
scientific article |
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
