(2+2)-free posets, ascent sequences and pattern avoiding permutations
From MaRDI portal
Publication:986124
DOI10.1016/j.jcta.2009.12.007zbMath1225.05026arXiv0806.0666OpenAlexW2121947368WikidataQ60692211 ScholiaQ60692211MaRDI QIDQ986124
Anders Claesson, Sergey Kitaev, Mireille Bousquet-Mélou, Mark Dukes
Publication date: 11 August 2010
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0806.0666
encodeinvolutionchord diagramascent sequencepattern avoiding permutation(2+2)-free posetenumeratenon-D-finite series
Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07)
Related Items
Proof of a bi-symmetric septuple equidistribution on ascent sequences ⋮ Generation and enumeration of some classes of interval orders ⋮ The combinatorics of Jeff Remmel ⋮ Schröder partitions, Schröder tableaux and weak poset patterns ⋮ Congruences for Taylor expansions of quantum modular forms ⋮ Congruences for Fishburn numbers modulo prime powers ⋮ Web worlds, web-colouring matrices, and web-mixing matrices ⋮ Enumeration of graded (3+1)-avoiding posets ⋮ Some enumerative results related to ascent sequences ⋮ Shape-Wilf-equivalences for vincular patterns ⋮ Wilf-classification of mesh patterns of short length ⋮ Unnamed Item ⋮ On a conjecture about enumerating \((2+2)\)-free posets ⋮ Algorithmic coincidence classification of mesh patterns ⋮ Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry ⋮ Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow ⋮ Inversion sequences avoiding pairs of patterns ⋮ Fishburn trees ⋮ Bi-symmetric multiple equidistributions on ascent sequences ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ Dynamical aspects of \(\sigma\)-machines ⋮ Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics ⋮ Partitions and partial matchings avoiding neighbor patterns ⋮ Stanley-Wilf limits for patterns in rooted labeled forests ⋮ Enumeration schemes for vincular patterns ⋮ Moments of permutation statistics and central limit theorems ⋮ A combinatorial study of async/await processes ⋮ Permutation classes and polyomino classes with excluded submatrices ⋮ Symmetric generating functions and Euler-Stirling statistics on permutations ⋮ Unnamed Item ⋮ Ascent sequences and 3-nonnesting set partitions ⋮ On \(q\)-series identities related to interval orders ⋮ Catalan pairs: a relational-theoretic approach to Catalan numbers ⋮ Efficient generation of restricted growth words ⋮ Unnamed Item ⋮ Decomposing labeled interval orders as pairs of permutations ⋮ On \(\underline{12} 0\)-avoiding inversion and ascent sequences ⋮ A polyominoes-permutations injection and tree-like convex polyominoes ⋮ Counting general and self-dual interval orders ⋮ Asymptotics and statistics on Fishburn matrices and their generalizations ⋮ On the Möbius function and topology of general pattern posets ⋮ Equidistributed statistics on matchings and permutations ⋮ Equidistributed statistics on Fishburn matrices and permutations ⋮ Catalan pairs and Fishburn triples ⋮ Catalan words avoiding pairs of length three patterns ⋮ Coxeter-bicatalan combinatorics ⋮ Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations ⋮ Exact counting of unlabeled rigid interval posets regarding or disregarding height ⋮ Partition and composition matrices ⋮ Asymptotics of the extremal excedance set statistic ⋮ Structure and enumeration of \((3+1)\)-free posets ⋮ Ascent sequences avoiding pairs of patterns ⋮ A new decomposition of ascent sequences and Euler-Stirling statistics ⋮ Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions ⋮ Patterns of relation triples in inversion and ascent sequences ⋮ Vincular patterns in inversion sequences ⋮ Asymptotics for the number of row-Fishburn matrices ⋮ Mesh patterns with superfluous mesh ⋮ On pattern-avoiding Fishburn permutations ⋮ $n!$ matchings, $n!$ posets ⋮ Refining the bijections among ascent sequences, \((2+2)\)-free posets, integer matrices and pattern-avoiding permutations ⋮ Hereditary semiorders and enumeration of semiorders by dimension ⋮ Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations ⋮ An operator on ascent sequences ⋮ Interval posets of permutations ⋮ Combinatorial properties of Catalan pairs ⋮ Pattern-avoiding ascent sequences of length 3 ⋮ Combinatorial generation via permutation languages. I. Fundamentals ⋮ Transport of patterns by Burge transpose ⋮ Weak ascent sequences and related combinatorial structures
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An obvious proof of Fishburn's interval order theorem
- Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
- Resurrecting the asymptotics of linear recurrences
- Counting interval orders
- Height counting of unlabeled interval and \(N\)-free posets.
- Generalized permutation patterns and a classification of the Mahonian statistics
- The umbral transfer-matrix method. I: Foundations
- Restricted permutations and the wreath product
- Generating trees and the Catalan and Schröder numbers
- Permutation classes of polynomial growth
- Forest-like permutations
- Intransitive indifference with unequal indifference intervals
- Betweenness, orders and interval graphs
- A direct encoding of Stoimenow's matchings as ascent sequences
- Crossings and nestings of matchings and partitions
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
- Intransitive Indifference in Preference Theory: A Survey
- A characterization of \((3+1)\)-free posets
- Vassiliev invariants and a strange identity related to the Dedekind eta-function
