Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
From MaRDI portal
Publication:2318489
Abstract: The combined work of Bousquet-M'elou, Claesson, Dukes, Jel'inek, Kitaev, Kubitzke and Parviainen has resulted in non-trivial bijections among ascent sequences, (2+2)-free posets, upper-triangular integer matrices, and pattern-avoiding permutations. To probe the finer behavior of these bijections, we study two types of restrictions on ascent sequences. These restrictions are motivated by our results that their images under the bijections are natural and combinatorially significant. In addition, for one restriction, we are able to determine the effect of poset duality on the corresponding ascent sequences, matrices and permutations, thereby answering a question of the first author and Parviainen in this case. The second restriction should appeal to Catalaniacs.
Recommendations
- Refining the bijections among ascent sequences, \((2+2)\)-free posets, integer matrices and pattern-avoiding permutations
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Pattern avoidance in ascent sequences
- scientific article; zbMATH DE number 6909264
- Ascent sequences and upper triangular matrices containing non-negative integers
Cites work
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- An obvious proof of Fishburn's interval order theorem
- Ascent sequences and upper triangular matrices containing non-negative integers
- Catalan lattices on series parallel interval orders
- Catalan Numbers
- Catalan pairs and Fishburn triples
- Catalan pairs: a relational-theoretic approach to Catalan numbers
- Composition matrices, \((2+2)\)-free posets and their specializations
- Counting general and self-dual interval orders
- Enumerating \((2 + 2)\)-free posets by indistinguishable elements
- Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
- Enumeration schemes for permutations avoiding barred patterns
- Equidistributed statistics on Fishburn matrices and permutations
- Generalized ballot sequences are ascent sequences
- Generating functions for weighted Hurwitz numbers
- Generating trees and the Catalan and Schröder numbers
- Hereditary semiorders and enumeration of semiorders by dimension
- scientific article; zbMATH DE number 3877239 (Why is no real title available?)
- scientific article; zbMATH DE number 5557896 (Why is no real title available?)
- On \(q\)-series identities related to interval orders
- On immanants of Jacobi-Trudi matrices and permutations with restricted position
- Partioning algorithms for finite sets
- Partition and composition matrices
- Pattern avoidance in ascent sequences
- Series-parallel posets and the Tutte polynomial
Cited in
(12)- Weak ascent sequences and related combinatorial structures
- Refining the bijections among ascent sequences, \((2+2)\)-free posets, integer matrices and pattern-avoiding permutations
- A direct encoding of Stoimenow's matchings as ascent sequences
- scientific article; zbMATH DE number 6909264 (Why is no real title available?)
- Fishburn trees
- Difference ascent sequences
- Pattern avoidance in revised ascent sequences
- Difference ascent sequences and related combinatorial structures
- On naturally labelled posets and permutations avoiding 12--34
- Revised ascent sequences avoiding a pattern of length 4
- Ascent sequences and upper triangular matrices containing non-negative integers
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
This page was built for publication: Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2318489)
