The X-class and almost-increasing permutations
From MaRDI portal
Publication:659614
DOI10.1007/s00026-011-0082-9zbMath1233.05011arXiv0710.5168OpenAlexW2593657431MaRDI QIDQ659614
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
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)
Related Items
The enumeration of permutations avoiding 3124 and 4312, Labelled well-quasi-order for permutation classes, A generating tree approach to \(k\)-nonnesting partitions and permutations, Scaling limits of permutation classes with a finite specification: a dichotomy, Square permutations are typically rectangular, Unimodal permutations and almost-increasing cycles, Permutation patterns, Stanley symmetric functions, and generalized Specht modules, Enumerating two permutation classes by the number of cycles, A bijection between evil-avoiding and rectangular permutations, A combinatorial classification of 2-regular simple modules for Nakayama algebras, Separable \(d\)-permutations and guillotine partitions, Growth rates of geometric grid classes of permutations, Geometric grid classes of permutations, Unknotted cycles, Combinatorial generation via permutation languages. I. Fundamentals, On the centrosymmetric permutations in a class
Cites Work
