Geodesic
Enumerating permutations that avoid three term arithmetic progressions
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

It is proved that the number of permutations of the set $\{1, 2, \dots, n\}$ that avoid three term arithmetic progressions is at most ${(2.7)^n} \over 21$ for $n \ge 11$ and at each end of any such permutation, at least ${\lfloor {n \over 2} \rfloor} - 6$ entries have the same parity.
DOI : 10.37236/152
Classification : 05A05, 05A15, 05A20, 05C55
Mots-clés : permutations avoiding three-term arithmetic progressions 
@article{10_37236_152,
     author = {Arun Sharma},
     title = {Enumerating permutations that avoid three term arithmetic progressions},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/152},
     zbl = {1187.05003},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/152/}
}
TY  - JOUR
AU  - Arun Sharma
TI  - Enumerating permutations that avoid three term arithmetic progressions
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/152/
DO  - 10.37236/152
ID  - 10_37236_152
ER  - 
%0 Journal Article
%A Arun Sharma
%T Enumerating permutations that avoid three term arithmetic progressions
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/152/
%R 10.37236/152
%F 10_37236_152
Arun Sharma. Enumerating permutations that avoid three term arithmetic progressions. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/152

Cité par Sources :