Explicit enumeration formulas for m-regular simple stacks

DOI10.1016/J.DISC.2024.114317MaRDI QIDQ6658051zbMATH OpenFDO

Authors Qiang-Hui Guo, Ying-Lie Jin, Lisa Hui Sun, Hang Yang, Jie Yang

Publication date 8 January 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2024.114317

zbMATH Keywords

Dyck pathNarayana numberprotein contact mapRNA secondary structurestack

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Physiological, cellular and medical topics (92Cxx)

Recommendations

• A semi-bijective algorithm for saturated extended 2-regular simple stacks
• Bijective enumeration of general stacks
• Combinatorics of locally optimal RNA secondary structures
• General combinatorics of RNA secondary structure
• scientific article; zbMATH DE number 3928776

Cites work

• A semi-bijective algorithm for saturated extended 2-regular simple stacks
• Bijective enumeration of general stacks
• Catalan Numbers
• Combinatorial algorithms for protein folding in lattice models: a survey of mathematical results
• Combinatorics of contacts in protein contact maps
• Combinatorics of RNA secondary structures
• Computation of Generating Functions for Biological Molecules
• Crossings and nestings of matchings and partitions
• Dyck path enumeration
• scientific article; zbMATH DE number 3675903 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 3308309 (Why is no real title available?)
• Linear trees and RNA secondary structure
• On \(abab\)-free and \(abba\)-free set partitions
• On a class of linked diagrams. I: Enumeration
• Reduction of \(m\)-regular noncrossing partitions
• Regular simple queues of protein contact maps
• RNA secondary structure: a complete mathematical analysis
• RNA secondary structures with given motif specification: combinatorics and algorithms
• The butterfly decomposition of plane trees

Cited in

(1)

• Bijective enumeration of general stacks

This page was built for publication: Explicit enumeration formulas for \(m\)-regular simple stacks

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