Generalized permutation patterns and a classification of the Mahonian statistics
From MaRDI portal
Publication:1580544
zbMath0957.05010MaRDI QIDQ1580544
Einar Steingrímsson, Eric K. Babson
Publication date: 25 September 2000
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/120841
Related Items
An involution on restricted Laguerre histories and its applications ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ Asymptotic normality of pattern counts in conjugacy classes ⋮ Moments of permutation statistics and central limit theorems ⋮ Vincular pattern avoidance on cyclic permutations ⋮ Homomesies on permutations: An analysis of maps and statistics in the FindStat database ⋮ Unnamed Item ⋮ Continued fractions and generalized patterns ⋮ Universality for random permutations and some other groups ⋮ Two oiseau decompositions of permutations and their application to Eulerian calculus ⋮ Avoiding vincular patterns on alternating words ⋮ Major index distribution over permutation classes ⋮ Decomposing simple permutations, with enumerative consequences ⋮ Mahonian \(Z\) statistics ⋮ Word-Representable Graphs: a Survey ⋮ Consecutive patterns in inversion sequences II: avoiding patterns of relations ⋮ Permutation pattern avoidance and the Catalan triangle ⋮ Restricted growth function patterns and statistics ⋮ Permutation tableaux and permutation patterns ⋮ Mahonian and Euler-Mahonian statistics for set partitions ⋮ Wilf equivalences between vincular patterns in inversion sequences ⋮ The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three ⋮ Eulerian quasisymmetric functions ⋮ Introduction to partially ordered patterns ⋮ The equidistribution of some length-three vincular patterns on \(S_n(132)\) ⋮ Restricted simsun permutations ⋮ Vincular pattern posets and the Möbius function of the quasi-consecutive pattern poset ⋮ Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths ⋮ Shape-Wilf-equivalences for vincular patterns ⋮ Wilf-classification of mesh patterns of short length ⋮ A linear time algorithm for consecutive permutation pattern matching ⋮ \((q, t)\)-Catalan numbers: gamma expansions, pattern avoidances, and the \((-1)\)-phenomenon ⋮ Algorithmic coincidence classification of mesh patterns ⋮ Unnamed Item ⋮ Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry ⋮ Counting words with Laguerre series ⋮ Refining enumeration schemes to count according to permutation statistics ⋮ Mahonian STAT on words ⋮ Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers ⋮ Consecutive patterns in permutations ⋮ Equidistributions of Mahonian statistics over pattern avoiding permutations ⋮ Generic rectangulations ⋮ Simple permutations and algebraic generating functions ⋮ Forbidden patterns and shift systems ⋮ Enumeration schemes for vincular patterns ⋮ Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations ⋮ Stack-sorting preimages of permutation classes ⋮ Inversion sequences avoiding consecutive patterns ⋮ Pattern-avoiding inversion sequences and open partition diagrams ⋮ Unnamed Item ⋮ Permutation patterns and statistics ⋮ Symmetry and log-concavity results for statistics on Fibonacci tableaux ⋮ Restricted non-separable planar maps and some pattern avoiding permutations ⋮ Efficient generation of restricted growth words ⋮ Passing through a stack k times ⋮ Counting Ordered Patterns in Words Generated by Morphisms ⋮ Eulerian polynomials and excedance statistics ⋮ Avoidance of partitions of a three-element set ⋮ On \(\underline{12} 0\)-avoiding inversion and ascent sequences ⋮ A polyominoes-permutations injection and tree-like convex polyominoes ⋮ The Hopf algebra of diagonal rectangulations. ⋮ Tableaux combinatorics for the asymmetric exclusion process ⋮ Enumeration of Stack-Sorting Preimages via a Decomposition Lemma ⋮ Enumeration of Dumont permutations avoiding certain four-letter patterns ⋮ Actions on permutations and unimodality of descent polynomials ⋮ A new bijective proof of Babson and Steingrímsson's conjecture ⋮ Algebraic and combinatorial structures on pairs of twin binary trees ⋮ Asymptotics of the extremal excedance set statistic ⋮ Logarithmic behavior of some combinatorial sequences ⋮ Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations ⋮ Generalized statistics on \(S_{n}\) and pattern avoidance ⋮ Asymptotic enumeration of permutations avoiding generalized patterns ⋮ Decreasing subsequences in permutations and Wilf equivalence for involutions ⋮ The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2 ⋮ A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations ⋮ Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials ⋮ Generalized pattern avoidance ⋮ (2+2)-free posets, ascent sequences and pattern avoiding permutations ⋮ The sorting index ⋮ Pattern-avoiding polytopes ⋮ Babson-Steingrímsson statistics are indeed Mahonian (and sometimes even Euler-Mahonian) ⋮ Rook theory for perfect matchings ⋮ Vincular patterns in inversion sequences ⋮ Restricted 123-avoiding Baxter permutations and the Padovan numbers ⋮ Where the monotone pattern (mostly) rules ⋮ On pattern avoiding indecomposable permutations ⋮ Bijections for permutation tableaux ⋮ Mesh patterns with superfluous mesh ⋮ Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations ⋮ The sets of flattened partitions with forbidden patterns ⋮ Counting pattern avoiding permutations by number of movable letters ⋮ Restricted \(k\)-ary words and functional equations ⋮ Passing through a stack \(k\) times with reversals ⋮ Cyclic pattern containment and avoidance ⋮ From \(q\)-Stirling numbers to the ordered multiset partitions: a viewpoint from vincular patterns ⋮ Combinatorics of the 2-species exclusion processes, marked Laguerre histories, and partially signed permutations ⋮ Partially ordered generalized patterns ⋮ Mahonian STAT on rearrangement class of words ⋮ 𝑞-Eulerian polynomials: Excedance number and major index ⋮ Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials ⋮ Combinatorial generation via permutation languages. I. Fundamentals ⋮ Inversion polynomials for permutations avoiding consecutive patterns ⋮ Transport of patterns by Burge transpose ⋮ Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations ⋮ Pattern-functions, statistics, and shallow permutations ⋮ Segmental partially ordered generalized patterns
This page was built for publication: Generalized permutation patterns and a classification of the Mahonian statistics
