Ascent sequences avoiding a triple of length-3 patterns

DOI10.37236/12720MaRDI QIDQ7007756zbMATH OpenFDO

Authors David Callan, Toufik Mansour

Publication date 25 March 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/12720

zbMATH Keywords

\(A\)-Wilf-equivalent sets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Other combinatorial number theory (11B75) Special sequences and polynomials (11B83)

Cites work

• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• 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 pairs of patterns
• Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
• Enumerating \((2 + 2)\)-free posets by indistinguishable elements
• Generating trees and forbidden subsequences
• Pattern avoidance in ascent sequences
• Patterns in permutations and words.
• Restricted ascent sequences and Catalan numbers
• Some enumerative results related to ascent sequences

Cited in

(1)

• Ascent sequences and weak ascent sequences avoiding a quadruple of length-3 patterns

This page was built for publication: Ascent sequences avoiding a triple of length-3 patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7007756)