The X-class and almost-increasing permutations

DOI10.1007/s00026-011-0082-9zbMath1233.05011arXiv0710.5168MaRDI QIDQ659614

Sergi Elizalde

Publication date: 24 January 2012

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

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

zbMATH Keywords

pattern-avoiding permutation; cycle diagram; picture class; X-class

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

05A19: Combinatorial identities, bijective combinatorics

05A05: Permutations, words, matrices

Related Items

Labelled well-quasi-order for permutation classes, On the centrosymmetric permutations in a class, Combinatorial generation via permutation languages. I. Fundamentals, Enumerating two permutation classes by the number of cycles, A generating tree approach to \(k\)-nonnesting partitions and permutations, Permutation patterns, Stanley symmetric functions, and generalized Specht modules, Growth rates of geometric grid classes of permutations, Separable \(d\)-permutations and guillotine partitions, Unknotted cycles, Scaling limits of permutation classes with a finite specification: a dichotomy, A combinatorial classification of 2-regular simple modules for Nakayama algebras, The enumeration of permutations avoiding 3124 and 4312, Unimodal permutations and almost-increasing cycles, Square permutations are typically rectangular, Geometric grid classes of permutations

Cites Work

• Combinatorial aspects of continued fractions. (Reprint)
• Unnamed Item
• Unnamed Item