Catalan structures arising from pattern-avoiding Stoimenow matchings and other Fishburn objects
From MaRDI portal
Cites work
- $n!$ matchings, $n!$ posets
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- A decomposition theorem for partially ordered sets
- A direct encoding of Stoimenow's matchings as ascent sequences
- A Dual of Dilworth's Decomposition Theorem
- Ascent sequences and upper triangular matrices containing non-negative integers
- Catalan pairs: a relational-theoretic approach to Catalan numbers
- Counting general and self-dual interval orders
- Crossings and nestings of matchings and partitions
- Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
- Equidistributed statistics on Fishburn matrices and permutations
- scientific article; zbMATH DE number 3877239 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- Interval lengths for interval orders: A minimization problem
- On a conjecture about enumerating \((2+2)\)-free posets
- On naturally labelled posets and permutations avoiding 12--34
- On pattern-avoiding Fishburn permutations
- Pattern avoidance in ascent sequences
- Refining the bijections among ascent sequences, \((2+2)\)-free posets, integer matrices and pattern-avoiding permutations
- Some more properties of Catalan numbers
- The structure of Sperner k-families
- Transport of patterns by Burge transpose
This page was built for publication: Catalan structures arising from pattern-avoiding Stoimenow matchings and other Fishburn objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7302259)
