Refining the bijections among ascent sequences, \((2+2)\)-free posets, integer matrices and pattern-avoiding permutations
From MaRDI portal
Publication:2306469
zbMath1436.05020MaRDI QIDQ2306469
Mark Dukes, Peter R. W. McNamara
Publication date: 23 March 2020
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: http://www.mat.univie.ac.at/~slc/wpapers/FPSAC2019//20.html
interval orderpattern avoidanceascent sequenceseries-parallel poset\((2+2)\)-free posetupper-diagonal matrix
Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07)
Cites Work
- Catalan pairs and Fishburn triples
- Partition and composition matrices
- Composition matrices, \((2+2)\)-free posets and their specializations
- Enumerating \((2 + 2)\)-free posets by indistinguishable elements
- Counting general and self-dual interval orders
- Pattern avoidance in ascent sequences
- Equidistributed statistics on Fishburn matrices and permutations
- An obvious proof of Fishburn's interval order theorem
- Ascent sequences and upper triangular matrices containing non-negative integers
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Series-parallel posets and the Tutte polynomial
- Catalan pairs: a relational-theoretic approach to Catalan numbers
- Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
- On \(q\)-series identities related to interval orders
This page was built for publication: Refining the bijections among ascent sequences, \((2+2)\)-free posets, integer matrices and pattern-avoiding permutations
