Pattern avoidance in weak ascent sequences

DOI10.46298/DMTCS.12273MaRDI QIDQ6606909zbMATH OpenFDO

Authors Beáta Bényi, Toufik Mansour, José L. Ramírez

Publication date 17 September 2024

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.46298/DMTCS.12273

zbMATH Keywords

generating functionpattern avoidanceweak ascent sequence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Recommendations

• Weak ascent sequences and related combinatorial structures
• Pattern avoidance in ascent sequences
• Ascent sequences avoiding pairs of patterns

Cites work

• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• Catalan Numbers
• Enumerations of ordered trees
• Generating trees and forbidden subsequences
• Pattern avoidance in ascent sequences
• Pattern avoidance in inversion sequences
• Patterns in inversion sequences. I.
• Sequences that satisfy a(n-a(n))=0
• Weak ascent sequences and related combinatorial structures

Cited in

(3)

• Pattern avoidance in revised ascent sequences
• Wilf classes for weak ascent sequences avoiding a pair or triple of length-3 patterns
• Ascent sequences and weak ascent sequences avoiding a quadruple of length-3 patterns

This page was built for publication: Pattern avoidance in weak ascent sequences

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