Modular, k-noncrossing diagrams

From MaRDI portal
Publication:976735

zbMATH Open1207.05014arXiv1003.2710MaRDI QIDQ976735FDOQ976735

Rita R. Wang, Albus Y. Y. Zhao, Christian M. Reidys

Publication date: 16 June 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: In this paper we compute the generating function of modular, k-noncrossing diagrams. A k-noncrossing diagram is called modular if it does not contains any isolated arcs and any arc has length at least four. Modular diagrams represent the deformation retracts of RNA pseudoknot structures cite{Stadler:99,Reidys:07pseu,Reidys:07lego} and their properties reflect basic features of these bio-molecules. The particular case of modular noncrossing diagrams has been extensively studied cite{Waterman:78b, Waterman:79,Waterman:93, Schuster:98}. Let sfQk(n) denote the number of modular k-noncrossing diagrams over n vertices. We derive exact enumeration results as well as the asymptotic formula sfQk(n)simckn(k1)2frack12gammakn for k=3,...,9 and derive a new proof of the formula sfQ2(n)sim1.4848,n3/2,1.8489n cite{Schuster:98}.


Full work available at URL: https://arxiv.org/abs/1003.2710

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cited In (8)





This page was built for publication: Modular, \(k\)-noncrossing diagrams

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