Partially ordered generalized patterns
From MaRDI portal
Publication:2566285
DOI10.1016/j.disc.2004.03.017zbMath1070.05002OpenAlexW1984249895MaRDI QIDQ2566285
Publication date: 22 September 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.03.017
Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Permutations, words, matrices (05A05)
Related Items (22)
Pattern avoidance in poset permutations ⋮ The \(q\)-exponential generating function for permutations by consecutive patterns and inversions ⋮ Permutations and words counted by consecutive patterns ⋮ Introduction to partially ordered patterns ⋮ Shape-Wilf-equivalences for vincular patterns ⋮ Refining enumeration schemes to count according to permutation statistics ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ On permutations avoiding partially ordered patterns defined by bipartite graphs ⋮ Enumeration schemes for vincular patterns ⋮ Non-overlapping descents and ascents in stack-sortable permutations ⋮ Unnamed Item ⋮ Generating functions for permutations avoiding a consecutive pattern ⋮ Some results on the avoidance of vincular patterns by multisets ⋮ Counting descent pairs with prescribed tops and bottoms ⋮ On uniquely \(k\)-determined permutations ⋮ Asymptotic enumeration of permutations avoiding generalized patterns ⋮ Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials ⋮ Joint distributions of permutation statistics and the parabolic cylinder functions ⋮ On partially ordered patterns of length 4 and 5 in permutations ⋮ On a stochastic order induced by an extension of Panjer's family of discrete distributions ⋮ Combinatorial generation via permutation languages. I. Fundamentals ⋮ Segmental partially ordered generalized patterns
Cites Work
This page was built for publication: Partially ordered generalized patterns
