Revised ascent sequences avoiding a pattern of length 4

MaRDI QIDQ7308687zbMATH OpenFDO

Authors Robin D. P. Zhou, Cuicui Wang

Publication date 4 August 2026

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://ajc.maths.uq.edu.au/pdf/95/ajc_v95_p335.pdf

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Cites work

• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• A new decomposition of ascent sequences and Euler-Stirling statistics
• Ascent sequences and 3-nonnesting set partitions
• ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
• Fishburn trees
• scientific article; zbMATH DE number 3877239 (Why is no real title available?)
• Interval graphs and interval orders
• Modified ascent sequences and Bell numbers
• On \(\underline{12} 0\)-avoiding inversion and ascent sequences
• On 021-avoiding ascent sequences
• Pattern avoidance in ascent sequences
• Pattern avoidance in revised ascent sequences
• Pattern-avoiding modified ascent sequences
• Patterns of relation triples in inversion and ascent sequences
• Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
• Some enumerative results related to ascent sequences
• Transport of patterns by Burge transpose

This page was built for publication: Revised ascent sequences avoiding a pattern of length \(4\)

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