Modular, \(k\)-noncrossing diagrams (Q976735)

Summary: We compute the generating function of modular, \(k\)-noncrossing diagrams. A \(k\)-noncrossing diagram is called modular if it does not contain any isolated arcs and any arc has length at least four. Modular diagrams represent the deformation retracts of RNA tertiary structures and their properties reflect basic features of these bio-molecules. The particular case of modular noncrossing diagrams has been extensively studied. Let \(\mathbb{Q}_k(n)\) denote the number of modular \(k\)-noncrossing diagrams over \(n\) vertices. We derive exact enumeration results as well as the asymptotic formula \[ \mathbb{Q}_k(n)\sim c_kn^{-(-1)^2-{k-1\over 2}}\gamma^{-n}_k \] for \(k=3,\dots,9\) and derive a new proof of the formula \(\mathbb{Q}_2(n)\sim 1.8489^n\) [\textit{I. L. Hofacker}, \textit{P. Schuster} and \textit{P. F. Stadler}, Discrete Appl. Math. 88, No. 1--3, 207--237 (1998; Zbl 0918.05004)].