Difference ascent sequences and related combinatorial structures
From MaRDI portal
Cites work
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- $n!$ matchings, $n!$ posets
- A direct encoding of Stoimenow's matchings as ascent sequences
- A new decomposition of ascent sequences and Euler-Stirling statistics
- A note on \(p\)-ascent sequences
- Ascent sequences and 3-nonnesting set partitions
- Ascent sequences and the binomial convolution of Catalan numbers
- Ascent sequences and upper triangular matrices containing non-negative integers
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
- Catalan pairs and Fishburn triples
- Difference ascent sequences
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
- Equidistributed statistics on Fishburn matrices and permutations
- Generalized ballot sequences are ascent sequences
- scientific article; zbMATH DE number 3877239 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- On \(\underline{12} 0\)-avoiding inversion and ascent sequences
- On 021-avoiding ascent sequences
- Pattern avoidance in ascent sequences
- Pattern-avoiding ascent sequences of length 3
- Proof of a bi-symmetric septuple equidistribution on ascent sequences
- Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
- Some enumerative results related to ascent sequences
- Weak ascent sequences and related combinatorial structures
Cited in
(3)
This page was built for publication: Difference ascent sequences and related combinatorial structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7006226)