Geodesic
Modular, \(k\)-noncrossing diagrams
The electronic journal of combinatorics, Tome 17 (2010)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this paper 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 ${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 ${Q}_k(n)\sim c_k n^{-(k-1)^2-{k-1\over2}}\gamma_{k}^{-n}$ for $k=3, \ldots, 9$ and derive a new proof of the formula ${Q}_2(n)\sim 1.4848\, n^{-3/2}\,1.8489^{n}$ (Hofacker et al. 1998).
DOI : 10.37236/348
Classification : 05A15, 05C62 
@article{10_37236_348,
     author = {Christian M. Reidys and Rita R. Wang and Albus Y. Y. Zhao},
     title = {Modular, \(k\)-noncrossing diagrams},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/348},
     zbl = {1207.05014},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/348/}
}
TY  - JOUR
AU  - Christian M. Reidys
AU  - Rita R. Wang
AU  - Albus Y. Y. Zhao
TI  - Modular, \(k\)-noncrossing diagrams
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/348/
DO  - 10.37236/348
ID  - 10_37236_348
ER  - 
%0 Journal Article
%A Christian M. Reidys
%A Rita R. Wang
%A Albus Y. Y. Zhao
%T Modular, \(k\)-noncrossing diagrams
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/348/
%R 10.37236/348
%F 10_37236_348
Christian M. Reidys; Rita R. Wang; Albus Y. Y. Zhao. Modular, \(k\)-noncrossing diagrams. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/348

Cité par Sources :