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

DOI10.5281/ZENODO.17144266MaRDI QIDQ6920514zbMATH OpenFDO

Authors David Callan, Toufik Mansour

Publication date 7 October 2025

Published in Integers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5281/ZENODO.17144266

zbMATH Keywords

ascent sequencesDyck pathsgenerating treespattern avoidance

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial identities, bijective combinatorics (05A19)

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 a triple of length-3 patterns
• 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
• Inversion sequences avoiding quadruple length-3 patterns
• Pattern avoidance in ascent sequences
• Pattern avoidance in weak ascent sequences
• Patterns in permutations and words.
• Restricted ascent sequences and Catalan numbers
• Some enumerative results related to ascent sequences
• Weak ascent sequences and related combinatorial structures
• Wilf classes for weak ascent sequences avoiding a pair or triple of length-3 patterns

This page was built for publication: Ascent sequences and weak ascent sequences avoiding a quadruple of length-3 patterns

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