Explicit enumeration of 321, hexagon-avoiding permutations

DOI10.1016/j.disc.2003.06.003zbMath1041.05003arXivmath/0106073OpenAlexW1968120658MaRDI QIDQ1827678

Julian West, Zvezdelina E. Stankova

Publication date: 6 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Schubert varietiesKazhdan-Lusztig polynomialsHeapsLinear recurrence321, hexagon-avoiding permutationsForbidden subsequences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (4)

Labelled well-quasi-order for permutation classes ⋮ The enumeration of maximally clustered permutations ⋮ Finitely labeled generating trees and restricted permutations ⋮ Enumeration Schemes for Restricted Permutations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representations of Coxeter groups and Hecke algebras
• The number of Baxter permutations
• Some combinatorial properties of Schubert polynomials
• Forbidden subsequences
• A new class of Wilf-equivalent permutations
• 321-polygon-avoiding permutations and Chebyshev polynomials
• Generating trees and the Catalan and Schröder numbers
• Classification of forbidden subsequences of length 4
• Generating trees and forbidden subsequences
• Wilf-equivalence for singleton classes
• Longest Increasing and Decreasing Subsequences
• Applications of the Theory of Morse to Symmetric Spaces
• The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent
• Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations

This page was built for publication: Explicit enumeration of 321, hexagon-avoiding permutations