Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. The enumeration of f ...
Conference paper

The enumeration of fully commutative affine permutations

Christopher R. H. Hanusa ORCID (1), Brant C. Jones (2)
(1) Department of Mathematics [New York CUNY]
(2) Department of Mathematics and Statistics
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2010
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
Proceedings
DOI
10.46298/dmtcs.2925
License
https://about.hal.science/hal-authorisation-v1
National Science Foundation
0636297
EMSW21-VIGRE: Focus on Mathematics
Indicators
539
Views
506
Downloads

The enumeration of fully commutative affine permutations

Christopher R. H. Hanusa ORCID (1), Brant C. Jones (2)
(1) Department of Mathematics [New York CUNY]
(2) Department of Mathematics and Statistics
Abstract
English
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.
French
Nous présentons une fonction génératrice qui énumère les permutations affines totalement commutatives par leur rang et par leur longueur de Coxeter, généralisant les formules dues à Stembridge et à Barcucci–Del Lungo–Pergola–Pinzani. Pour un rang précis, les fonctions génératrices ont des coefficients qui sont périodiques de période divisant leur rang. Nous obtenons des résultats qui expliquent la structure des permutations affines totalement commutatives. L'article dessous est un aperçu des résultats; la version complète appara\^ıt ailleurs.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • affine Coxeter group
  • abacus diagram
  • window notation
  • complete notation
  • fully commutative
Cited by

Source: OpenCitations

  • Affine Permutations and an Affine Catalan Monoid

    Fields Institute communications

    Authors : Tom Denton

    Journal reference : Volume , 2014, pp. 339-354

    DOI : 10.1007/978-1-4939-0938-4_15
  • Extended Abstract for Enumerating Pattern Avoidance for Affine Permutations

    Discrete Mathematics & Theoretical Computer Science

    Authors : Andrew Crites

    Journal reference : Volume DMTCS Proceedings vol. AN,..., 2010, pp.

    DOI : 10.46298/dmtcs.2819
Preview
Loading PDF preview...