Skip to Main content Skip to Navigation
Journal articles

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
Document type :
Journal articles
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-00959020
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, March 13, 2014 - 5:06:34 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:21 AM
Long-term archiving on: : Friday, June 13, 2014 - 12:15:15 PM

File

dm060218.pdf
Files produced by the author(s)

Identifiers

  • 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⟩

Share

Metrics

Record views

128

Files downloads

686