On an open problem of Green and Losonczy: exact enumeration of freely braided permutations

Abstract : Recently, Green and Losonczy~GL1,GL2 introduced \emphfreely braided permutation as a special class of restricted permutations has arisen in representation theory. The freely braided permutations were introduced and studied as the upper bound for the number of commutation classes of reduced expressions for an element of a simply laced Coxeter group is achieved if and only if when the element is freely braided. In this paper, we prove that the generating function for the number of freely braided permutations in S_n is given by \par (1-3x-2x^2+(1+x)√1-4x) / (1-4x-x^2+(1-x^2)√1-4x).\par
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2004, 6 (2), pp.461-470
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00959020
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : jeudi 13 mars 2014 - 17:06:34
Dernière modification le : mercredi 29 novembre 2017 - 10:26:21
Document(s) archivé(s) le : vendredi 13 juin 2014 - 12:15:15

Fichier

dm060218.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00959020, version 1

Collections

Citation

Toufik Mansour. On an open problem of Green and Losonczy: exact enumeration of freely braided permutations. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2004, 6 (2), pp.461-470. 〈hal-00959020〉

Partager

Métriques

Consultations de la notice

91

Téléchargements de fichiers

168