Ascent sequences avoiding a triple of 3-letter patterns and Fibonacci numbers

DOI10.26493/2590-9770.1716.1D3zbMATH Open1547.05007MaRDI QIDQ6629799

D. Callan, Toufik Mansour

Publication date: 30 October 2024

Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Fibonacci numbersascent sequences

Mathematics Subject Classification ID

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

Cites Work

• Some enumerative results related to ascent sequences
• Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
• Patterns in permutations and words.
• Enumerating \((2 + 2)\)-free posets by indistinguishable elements
• Pattern avoidance in ascent sequences
• Ascent sequences and upper triangular matrices containing non-negative integers
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• Ascent sequences avoiding pairs of patterns
• Restricted ascent sequences and Catalan numbers
• Ascent sequences and Fibonacci numbers

This page was built for publication: Ascent sequences avoiding a triple of 3-letter patterns and Fibonacci numbers

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