Combinatorial trees arising in the study of interval exchange transformations

DOI10.1016/j.ejc.2011.05.002zbMath1232.05192OpenAlexW2080141142MaRDI QIDQ648999

Sébastien Ferenczi, Julien Cassaigne, Luca Q. Zamboni

Publication date: 29 November 2011

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.05.002

zbMATH Keywords

Catalan numberinductioninterval exchange transformationRNAsmallest set of tresstrees of relations

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Structural characterization of families of graphs (05C75) Genetics and epigenetics (92D10)

Related Items (3)

A circular order on edge-coloured trees and RNA \(m\)-diagrams ⋮ Diagonal changes for every interval exchange transformation ⋮ Diagonal changes for surfaces in hyperelliptic components

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Structure of \(K\)-interval exchange transformations: induction, trajectories, and distance theorems
• Counting cluster-tilted algebras of type $A_n$
• Eigenvalues and simplicity of interval exchange transformations
• Enumeration of Triangulations of the Disk
• Counting Ordered Trees by Permuting Their Parts

This page was built for publication: Combinatorial trees arising in the study of interval exchange transformations