On ascent sequences avoiding 021 and a pattern of length four
From MaRDI portal
Cites work
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers
- A direct encoding of Stoimenow's matchings as ascent sequences
- Ascent sequences and 3-nonnesting set partitions
- Ascent sequences and Fibonacci numbers
- Ascent sequences and upper triangular matrices containing non-negative integers
- Ascent sequences avoiding a triple of 3-letter patterns and Fibonacci numbers
- Ascent sequences avoiding a triple of length-3 patterns
- Ascent sequences avoiding pairs of patterns
- Difference ascent sequences
- Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
- scientific article; zbMATH DE number 2104721 (Why is no real title available?)
- Inversion sequences avoiding 021 and another pattern of length four
- Kernel method and linear recurrence system
- On 021-avoiding ascent sequences
- On multiple pattern avoiding set partitions
- Pattern avoidance in ascent sequences
- Pattern-avoiding modified ascent sequences
- Patterns in permutations and words.
- Rationality for subclasses of 321-avoiding permutations
- Restricted 132-alternating permutations and Chebyshev polynomials
- Restricted 132-avoiding \(k\)-ary words, Chebyshev polynomials, and continued fractions
- Restricted 132-avoiding permutations
- Restricted 123-involutions
- Restricted ascent sequences and Catalan numbers
- Restricted permutations
- Some enumerative results related to ascent sequences
- Some statistics on restricted 132 involutions
- Weak ascent sequences and related combinatorial structures
This page was built for publication: On ascent sequences avoiding 021 and a pattern of length four
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363471)
