Geodesic
The enumeration of fully commutative affine permutations
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) (2011).

Voir la notice de l'article provenant de la source Episciences

We give a generating function for the fully commutative affine permutations enumerated by rank and Coxeter length, extending formulas due to Stembridge and Barcucci–Del Lungo–Pergola–Pinzani. For fixed rank, the length generating functions have coefficients that are periodic with period dividing the rank. In the course of proving these formulas, we obtain results that elucidate the structure of the fully commutative affine permutations. This is a summary of the results; the full version appears elsewhere. 
@article{DMTCS_2011_special_260_a38,
     author = {Hanusa, Christopher R. H. and Jones, Brant C.},
     title = {The enumeration of fully commutative affine permutations},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)},
     year = {2011},
     doi = {10.46298/dmtcs.2925},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2925/}
}
TY  - JOUR
AU  - Hanusa, Christopher R. H.
AU  - Jones, Brant C.
TI  - The enumeration of fully commutative affine permutations
JO  - Discrete mathematics & theoretical computer science
PY  - 2011
VL  - DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2925/
DO  - 10.46298/dmtcs.2925
LA  - en
ID  - DMTCS_2011_special_260_a38
ER  - 
%0 Journal Article
%A Hanusa, Christopher R. H.
%A Jones, Brant C.
%T The enumeration of fully commutative affine permutations
%J Discrete mathematics & theoretical computer science
%D 2011
%V DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2925/
%R 10.46298/dmtcs.2925
%G en
%F DMTCS_2011_special_260_a38
Hanusa, Christopher R. H.; Jones, Brant C. The enumeration of fully commutative affine permutations. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) (2011). doi : 10.46298/dmtcs.2925. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2925/

Cité par Sources :