Some permutations with forbidden subsequences and their inversion number
From MaRDI portal
Publication:5936048
DOI10.1016/S0012-365X(00)00359-9zbMath0992.05003MaRDI QIDQ5936048
Elisa Pergola, Alberto del Lungo, Renzo Pinzani, Elena Barcucci
Publication date: 11 September 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Polyominoes (05B50)
Related Items (13)
321-avoiding affine permutations and their many heaps ⋮ Area of Catalan paths on a checkerboard ⋮ Inversion polynomials for 321-avoiding permutations ⋮ Solving multivariate functional equations ⋮ 321-avoiding affine permutations, heaps, and periodic parallelogram polyominoes ⋮ Refining enumeration schemes to count according to permutation statistics ⋮ Fully commutative elements in finite and affine Coxeter groups ⋮ Decreasing subsequences in permutations and Wilf equivalence for involutions ⋮ The enumeration of fully commutative affine permutations ⋮ Length enumeration of fully commutative elements in finite and affine Coxeter groups ⋮ Combinatorics of fully commutative involutions in classical Coxeter groups ⋮ Random generation of trees and other combinatorial objects ⋮ Steep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functions
This page was built for publication: Some permutations with forbidden subsequences and their inversion number
