Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations

zbMath0938.05003MaRDI QIDQ1967112

Rodica Simion

Publication date: 12 March 2000

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/120313

zbMATH Keywords

permutation statistics\(q\)-analoguenoncrossing partitionssigned permutationspattern-avoidancerestricted permutationspartition statisticscombinatorial statistics

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Permutations, words, matrices (05A05)

Related Items (13)

Labelled well-quasi-order for permutation classes ⋮ The \(q\)-log-convexity of the Narayana polynomials of type \(B\) ⋮ Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations ⋮ Diameters of graphs of reduced words and rank-two root subsystems ⋮ A type-B associahedron. ⋮ Generalized pattern-matching conditions for \(C_k \wr S_n\) ⋮ Generalized pattern avoidance condition for the wreath product of cyclic groups with symmetric groups ⋮ On noncrossing and nonnesting partitions of type \(D\) ⋮ Wilf classification of three and four letter signed patterns ⋮ Inversion generating functions for signed pattern avoiding permutations ⋮ Restricted signed permutations counted by the Schröder numbers ⋮ Cambrian lattices. ⋮ Two descent statistics over \(321\)-avoiding centrosymmetric involutions

This page was built for publication: Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations