(2+2)-free posets, ascent sequences and pattern avoiding permutations
From MaRDI portal
Publication:986124
Abstract: We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not known to be equinumerous. We present a direct bijection between them. The third class is a family of permutations defined in terms of a new type of pattern. An attractive property of these patterns is that, like classical patterns, they are closed under the action of , the symmetry group of the square. The fourth class is formed by certain integer sequences, called ascent sequences, which have a simple recursive structure and are shown to encode (2+2)-free posets and permutations. Our bijections preserve numerous statistics. We determine the generating function of these classes of objects, thus recovering a non-D-finite series obtained by Zagier for the class of chord diagrams. Finally, we characterize the ascent sequences that correspond to permutations avoiding the barred pattern and use this to enumerate those permutations, thereby settling a conjecture of Pudwell.
Recommendations
- scientific article; zbMATH DE number 6909264
- Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
- Refining the bijections among ascent sequences, \((2+2)\)-free posets, integer matrices and pattern-avoiding permutations
- Enumerating \((2 + 2)\)-free posets by indistinguishable elements
- On a conjecture about enumerating \((2+2)\)-free posets
- scientific article; zbMATH DE number 6806834
- Pattern avoidance in poset permutations
- Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
- Asymptotic enumeration of permutations avoiding generalized patterns
- Pattern avoidance in alternating permutations and tableaux (extended abstract)
Cites work
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- scientific article; zbMATH DE number 758277 (Why is no real title available?)
- scientific article; zbMATH DE number 6157245 (Why is no real title available?)
- A characterization of \((3+1)\)-free posets
- A direct encoding of Stoimenow's matchings as ascent sequences
- An obvious proof of Fishburn's interval order theorem
- Betweenness, orders and interval graphs
- Counting interval orders
- Crossings and nestings of matchings and partitions
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
- Forest-like permutations
- Generalized permutation patterns and a classification of the Mahonian statistics
- Generating trees and the Catalan and Schröder numbers
- Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
- Height counting of unlabeled interval and \(N\)-free posets.
- Intransitive Indifference in Preference Theory: A Survey
- Intransitive indifference with unequal indifference intervals
- Permutation classes of polynomial growth
- Restricted permutations and the wreath product
- Resurrecting the asymptotics of linear recurrences
- The umbral transfer-matrix method. I: Foundations
- Vassiliev invariants and a strange identity related to the Dedekind eta-function
Cited in
(83)- Efficient generation of restricted growth words
- Pattern-avoiding ascent sequences of length 3
- On a conjecture about enumerating \((2+2)\)-free posets
- Exact counting of unlabeled rigid interval posets regarding or disregarding height
- Pattern avoidance in ascent sequences
- Catalan pairs and Fishburn triples
- Wilf-classification of mesh patterns of short length
- On pattern-avoiding Fishburn permutations
- Some enumerative results related to ascent sequences
- Shape-Wilf-equivalences for vincular patterns
- Transport of patterns by Burge transpose
- Inversion sequences avoiding pairs of patterns
- Weak ascent sequences and related combinatorial structures
- Asymptotics for the number of row-Fishburn matrices
- Catalan words avoiding pairs of length three patterns
- Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
- On \(q\)-series identities related to interval orders
- Enumerating \((2 + 2)\)-free posets by indistinguishable elements
- Structure and enumeration of \((3+1)\)-free posets
- Enumeration schemes for vincular patterns
- Patterns of relation triples in inversion and ascent sequences
- Vincular patterns in inversion sequences
- Partitions and partial matchings avoiding neighbor patterns
- Generation and enumeration of some classes of interval orders
- Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow
- Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry
- Congruences for Taylor expansions of quantum modular forms
- scientific article; zbMATH DE number 6806834 (Why is no real title available?)
- Counting asymmetric weighted pyramids in non-decreasing Dyck paths
- Mesh patterns with superfluous mesh
- Refining the bijections among ascent sequences, \((2+2)\)-free posets, integer matrices and pattern-avoiding permutations
- Equidistributed statistics on Fishburn matrices and permutations
- Symmetric generating functions and Euler-Stirling statistics on permutations
- Permutation classes and polyomino classes with excluded submatrices
- Combinatorial properties of Catalan pairs
- Enumeration of graded (3+1)-avoiding posets
- Catalan pairs: a relational-theoretic approach to Catalan numbers
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
- Counting general and self-dual interval orders
- Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
- A polyominoes-permutations injection and tree-like convex polyominoes
- Asymptotics and statistics on Fishburn matrices and their generalizations
- Congruences for Fishburn numbers modulo prime powers
- Asymptotics of the extremal excedance set statistic
- Partition and composition matrices
- scientific article; zbMATH DE number 6909264 (Why is no real title available?)
- Coxeter-bicatalan combinatorics
- Equidistributed statistics on matchings and permutations
- Ascent sequences and 3-nonnesting set partitions
- $n!$ matchings, $n!$ posets
- Ascent sequences avoiding pairs of patterns
- On \(\underline{12} 0\)-avoiding inversion and ascent sequences
- Web worlds, web-colouring matrices, and web-mixing matrices
- On the Möbius function and topology of general pattern posets
- A new decomposition of ascent sequences and Euler-Stirling statistics
- Large deviations and ratio limit theorems for pattern-avoiding permutations
- Interval posets of permutations
- scientific article; zbMATH DE number 7731162 (Why is no real title available?)
- Decomposing labeled interval orders as pairs of permutations
- Schröder partitions, Schröder tableaux and weak poset patterns
- A combinatorial study of async/await processes
- Moments of permutation statistics and central limit theorems
- An operator on ascent sequences
- Algorithmic coincidence classification of mesh patterns
- Last symbol distribution in pattern avoiding Catalan words
- On enumeration of pattern-avoiding Fishburn permutations
- scientific article; zbMATH DE number 7765381 (Why is no real title available?)
- Enumerating pattern-avoiding Fishburn permutations subject to seven statistics
- Pattern avoidance in weak ascent sequences
- Stanley-Wilf limits for patterns in rooted labeled forests
- The combinatorics of Jeff Remmel
- Fishburn trees
- Differential transcendence of Bell numbers and relatives: a Galois theoretic approach
- Bi-symmetric multiple equidistributions on ascent sequences
- Proof of a bi-symmetric septuple equidistribution on ascent sequences
- Combinatorial generation via permutation languages. I: Fundamentals
- Ascent sequences avoiding a triple of 3-letter patterns and Fibonacci numbers
- Hereditary semiorders and enumeration of semiorders by dimension
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group
- Dynamical aspects of \(\sigma\)-machines
- Modified ascent sequences and Bell numbers
- Thresholds for patterns in random permutations with a given number of inversions
- Difference ascent sequences
This page was built for publication: (2+2)-free posets, ascent sequences and pattern avoiding permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q986124)
