scientific article; zbMATH DE number 6909264
From MaRDI portal
Publication:3176569
Recommendations
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- 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
- Asymptotic enumeration of permutations avoiding generalized patterns
- Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
- An exact enumeration of the unlabeled disconnected posets
- Pattern avoidance in poset permutations
Cited in
(8)- Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
- Pattern avoidance in ascent sequences
- Counting words with Laguerre series
- scientific article; zbMATH DE number 6806834 (Why is no real title available?)
- 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
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- \(n!\) matchings, \(n!\) posets (extended abstract)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176569)
