Pattern avoidance in weak ascent sequences

DOI10.46298/DMTCS.12273zbMATH Open1547.05005MaRDI QIDQ6606909FDOQ6606909

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

Publication date: 17 September 2024

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

zbMATH Keywords

generating functionpattern avoidanceweak ascent sequence

Mathematics Subject Classification ID

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

Cites Work

• Enumerations of ordered trees
• Catalan Numbers
• Patterns in inversion sequences. I.
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• Generating trees and forbidden subsequences
• Pattern avoidance in ascent sequences
• Pattern avoidance in inversion sequences
• Weak ascent sequences and related combinatorial structures
• Title not available (Why is that?)

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)