The enumeration of maximally clustered permutations

DOI10.1007/S00026-010-0052-7zbMATH Open1233.05009arXiv0704.3469OpenAlexW1978895499MaRDI QIDQ659577FDOQ659577

Authors: Hugh Denoncourt, Brant C. Jones 

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Abstract: The maximally clustered permutations are characterized by avoiding the classical permutation patterns 3421, 4312, and 4321. This class contains the freely-braided permutations and the fully-commutative permutations. In this work, we show that the generating functions for certain fully-commutative pattern classes can be transformed to give generating functions for the corresponding freely-braided and maximally clustered pattern classes. Moreover, this transformation of generating functions is rational. As a result, we obtain enumerative formulas for the pattern classes mentioned above as well as the corresponding hexagon-avoiding pattern classes where the hexagon-avoiding permutations are characterized by avoiding 46718235, 46781235, 56718234, and 56781234.

Full work available at URL: https://arxiv.org/abs/0704.3469

Recommendations

• Twelve subsets of permutations enumerated as maximally clustered permutations
• Clusters, generating functions and asymptotics for consecutive patterns in permutations
• scientific article; zbMATH DE number 2159652
• scientific article; zbMATH DE number 7058688
• Explicit enumeration of 321, hexagon-avoiding permutations

zbMATH Keywords

pattern avoidance2-sided weak Bruhat order321-hexagonfreely braidedmaximally clustered

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Restricted permutations
• Some combinatorial properties of Schubert polynomials
• Title not available (Why is that?)
• Combinatorial problems of commutation and rearrangements
• On the fully commutative elements of Coxeter groups
• Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations
• Schubert varieties and short braidedness
• The enumeration of fully commutative elements of Coxeter groups
• Pattern avoidance and the Bruhat order.
• Enumeration Schemes for Restricted Permutations
• Generating trees and forbidden subsequences
• Title not available (Why is that?)
• Reduced decompositions and permutation patterns
• Title not available (Why is that?)
• Freely braided elements in Coxeter groups.
• Freely braided elements in Coxeter groups. II.
• On rank functions for heaps
• Acyclic heaps of pieces. I.
• Explicit enumeration of 321, hexagon-avoiding permutations
• 321-polygon-avoiding permutations and Chebyshev polynomials
• Maximally clustered elements and Schubert varieties.
• Embedded factor patterns for Deodhar elements in Kazhdan-Lusztig theory.
• Kazhdan-Lusztig polynomials for maximally-clustered hexagon-avoiding permutations.
• Title not available (Why is that?)
• ACYCLIC HEAPS OF PIECES, II

Cited In (4)

• On inversion triples and braid moves
• Kazhdan-Lusztig polynomials for maximally-clustered hexagon-avoiding permutations.
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: The enumeration of maximally clustered permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659577)