(2+2)-free posets, ascent sequences and pattern avoiding permutations
From MaRDI portal
(Redirected from 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)- Some enumerative results related to ascent sequences
- Shape-Wilf-equivalences for vincular patterns
- Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
- Enumeration schemes for vincular patterns
- Enumerating \((2 + 2)\)-free posets by indistinguishable elements
- scientific article; zbMATH DE number 7731162 (Why is no real title available?)
- Pattern avoidance in ascent sequences
- Wilf-classification of mesh patterns of short length
- scientific article; zbMATH DE number 6909264 (Why is no real title available?)
- Web worlds, web-colouring matrices, and web-mixing matrices
- On \(\underline{12} 0\)-avoiding inversion and ascent sequences
- Partitions and partial matchings avoiding neighbor patterns
- Patterns of relation triples in inversion and ascent sequences
- Vincular patterns in inversion sequences
- Stanley-Wilf limits for patterns in rooted labeled forests
- Weak ascent sequences and related combinatorial structures
- Structure and enumeration of \((3+1)\)-free posets
- Ascent sequences avoiding pairs of patterns
- On \(q\)-series identities related to interval orders
- Generation and enumeration of some classes of interval orders
- Moments of permutation statistics and central limit theorems
- Coxeter-bicatalan combinatorics
- A new decomposition of ascent sequences and Euler-Stirling statistics
- Enumerating pattern-avoiding Fishburn permutations subject to seven statistics
- Schröder partitions, Schröder tableaux and weak poset patterns
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
- An operator on ascent sequences
- Combinatorial properties of Catalan pairs
- Algorithmic coincidence classification of mesh patterns
- Congruences for Fishburn numbers modulo prime powers
- Fishburn trees
- Proof of a bi-symmetric septuple equidistribution on ascent sequences
- Modified ascent sequences and Bell numbers
- A combinatorial study of async/await processes
- Difference ascent sequences
- scientific article; zbMATH DE number 7765381 (Why is no real title available?)
- Inversion sequences avoiding pairs of patterns
- Combinatorial generation via permutation languages. I: Fundamentals
- Catalan pairs: a relational-theoretic approach to Catalan numbers
- Large deviations and ratio limit theorems for pattern-avoiding permutations
- On the Möbius function and topology of general pattern posets
- Catalan words avoiding pairs of length three patterns
- Pattern avoidance in weak ascent sequences
- scientific article; zbMATH DE number 6806834 (Why is no real title available?)
- Last symbol distribution in pattern avoiding Catalan words
- Decomposing labeled interval orders as pairs of permutations
- Ascent sequences and 3-nonnesting set partitions
- Mesh patterns with superfluous mesh
- On a conjecture about enumerating \((2+2)\)-free posets
- 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
- Refined enumeration of permutations sorted with two stacks and a D₈-symmetry
- On pattern-avoiding Fishburn permutations
- Ascent sequences avoiding a triple of 3-letter patterns and Fibonacci numbers
- Thresholds for patterns in random permutations with a given number of inversions
- Counting asymmetric weighted pyramids in non-decreasing Dyck paths
- Exact counting of unlabeled rigid interval posets regarding or disregarding height
- Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow
- Congruences for Taylor expansions of quantum modular forms
- Symmetric generating functions and Euler-Stirling statistics on permutations
- $n!$ matchings, $n!$ posets
- Efficient generation of restricted growth words
- Equidistributed statistics on matchings and permutations
- Differential transcendence of Bell numbers and relatives: a Galois theoretic approach
- Catalan pairs and Fishburn triples
- Bi-symmetric multiple equidistributions on ascent sequences
- Counting general and self-dual interval orders
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group
- Dynamical aspects of \(\sigma\)-machines
- Asymptotics for the number of row-Fishburn matrices
- On enumeration of pattern-avoiding Fishburn permutations
- The combinatorics of Jeff Remmel
- Interval posets of permutations
- A polyominoes-permutations injection and tree-like convex polyominoes
- Asymptotics of the extremal excedance set statistic
- Hereditary semiorders and enumeration of semiorders by dimension
- Equidistributed statistics on Fishburn matrices and permutations
- Asymptotics and statistics on Fishburn matrices and their generalizations
- Permutation classes and polyomino classes with excluded submatrices
- Enumeration of graded (3+1)-avoiding posets
- Pattern-avoiding ascent sequences of length 3
- Transport of patterns by Burge transpose
- Partition and composition matrices
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)
