On Catalan trees and the Jacobian conjecture.
Singer, Dan (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Hercules and Hydra”
On Catalan trees and the Jacobian conjecture.
Infinite tree algebras
Bohdan Zelinka (1982)
Časopis pro pěstování matematiky
Similarity:
Bijective counting of tree-rooted maps and shuffles of parenthesis systems.
Bernardi, Olivier (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Thompson's group is not minimally almost convex.
Wladis, Claire (2007)
The New York Journal of Mathematics [electronic only]
Similarity:
Reconstruction of a tree from certain maximal proper subtrees
Ladislav Nebeský (1974)
Časopis pro pěstování matematiky
Similarity:
The triangles method to build -trees from incomplete distance matrices
Alain Guénoche, Bruno Leclerc (2001)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A method to infer -trees (valued trees having as set of leaves) from incomplete distance arrays (where some entries are uncertain or unknown) is described. It allows us to build an unrooted tree using only 2-3 distance values between the elements of , if they fulfill some explicit conditions. This construction is based on the mapping between -tree and a weighted generalized 2-tree spanning .