Entropies of the partitions of the unit interval generated by the Farey tree
Nikolai Moshchevitin, Anatoly Zhigljavsky (2004)
Acta Arithmetica
Similarity:
Displaying similar documents to “Orderings of the rationals and dynamical systems”
Entropies of the partitions of the unit interval generated by the Farey tree
Arithmetic and ergodic properties of 'flipped' continued fraction algorithms
K. Dajani, C. Kraaikamp, V. Masarotto (2012)
Acta Arithmetica
Similarity:
Hubbard trees
Alfredo Poirier (2010)
Fundamenta Mathematicae
Similarity:
We provide a full classification of postcritically finite polynomials as dynamical systems by means of Hubbard trees. The information encoded in these objects is solid enough to allow us recover all the relevant statical and dynamical aspects of the corresponding Julia sets.
-trees and normalization of pseudogroups.
Rimlinger, Frank (1992)
Experimental Mathematics
Similarity:
Some remarks on the enumeration of rooted trees
Z. A. Łomnicki (1973)
Applicationes Mathematicae
Similarity:
On A-Trees
Đuro Kurepa (1968)
Publications de l'Institut Mathématique
Similarity:
On some hypotheses concerning trees.
D. Kurepa (1977)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Completely Independent Spanning Trees in (Partial) k-Trees
Masayoshi Matsushita, Yota Otachi, Toru Araki (2015)
Discussiones Mathematicae Graph Theory
Similarity:
Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint. For a graph G, we denote the maximum number of pairwise completely independent spanning trees by cist(G). In this paper, we consider cist(G) when G is a partial k-tree. First we show that [k/2] ≤ cist(G) ≤ k − 1 for any k-tree G. Then we show that for any p ∈ {[k/2], . . . , k − 1}, there exist infinitely many k-trees G such...
Deducing Properties of Trees From Their Matula Numbers
Ivan Gutman, Yeong-Nan Yeh (1993)
Publications de l'Institut Mathématique
Similarity:
On the normal disconnection of a tree
A. Kośliński (1987)
Applicationes Mathematicae
Similarity:
On a matching distance between rooted phylogenetic trees
Damian Bogdanowicz, Krzysztof Giaro (2013)
International Journal of Applied Mathematics and Computer Science
Similarity:
The Robinson-Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach based on a minimum-weight perfect matching in bipartite graphs,...
The height of -binary search trees.
Drmota, Michael, Prodinger, Helmut (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Local extrema in random trees.
Clark, Lane (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
'The mother of all continued fractions'
Karma Dajani, Cor Kraaikamp (2000)
Colloquium Mathematicae
Similarity:
We give the relationship between regular continued fractions and Lehner fractions, using a procedure known as insertion}. Starting from the regular continued fraction expansion of any real irrational x, when the maximal number of insertions is applied one obtains the Lehner fraction of x. Insertions (and singularizations) show how these (and other) continued fraction expansions are related. We also investigate the relation between Lehner fractions and the Farey expansion (also known...