posted on 2015-03-09, 09:45authored byRobert J. Marsh, Sibylle Schroll
We study a circular order on labelled, m-edge-coloured trees with k vertices, and show that the set of such trees with a fixed circular order is in bijection with the set of RNA m-diagrams of degree k , combinatorial objects which can be regarded as RNA secondary structures of a certain kind. We enumerate these sets and show that the set of trees with a fixed circular order can be characterized as an equivalence class for the transitive closure of an operation which, in the case m=3, arises as an induction in the context of interval exchange transformations.
History
Citation
Advances in Applied Mathematics, 2014, 54, pp. 11-26 (16)
Author affiliation
/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Mathematics