Related papers: The Modular Tree of Pythagorus
A tanglegram consists of two rooted binary plane trees with the same number of leaves and a perfect matching between the two leaf sets. Tanglegrams are drawn with the leaves on two parallel lines, the trees on either side of the strip…
We study the structures of arbitrary split Leibniz triple systems. By developing techniques of connections of roots for this kind of triple systems, under certain conditions, in the case of $T$ being of maximal length, the simplicity of the…
The tree complex is a simplicial complex defined in recent work of Belk, Lanier, Margalit, and Winarski with natural applications to mapping class groups and complex dynamics. In this article, we connect this setting with the study of…
Using the theory of Properly Embedded Graphs developed in an earlier work we define an involutory duality on the set labeled non-crossing trees that lifts the obvious duality in the set of unlabeled non-crossing trees. The set of…
In this note we show that in addition to two integers forming a Pythagorean triple, there also exist two irrational numbers in terms of which this Pythagorean triple can also be obtained. We also put forward a relation between these two…
We study the action on the Bruhat-Tits tree of unit groups of maximal orders in certain quaternion algebras over $\mathbb{F}_q(T)$ and discuss applications to arithmetic geometry and group theory.
We determine the structure of the graded ring of Siegel modular forms of degree 3. It is generated by 19 modular forms, among which we identify a homogeneous system of parameters with 7 forms of weights 4, 12, 12, 14, 18, 20 and 30. We also…
We develop a theory of modulus triples, for future motivic applications.
Guided by physical needs, we deal with the rotationally isotropic Poincar\'e ball, when considering the complement of Borromean rings embedded in it. We consistently describe the geometry of the complement and realize the fundamental group…
A wired tree is a graph obtained from a tree by collapsing the leaves to a single vertex. We describe a pair of short exact sequences relating the sandpile group of a wired tree to the sandpile groups of its principal subtrees. In the case…
This is an exhaustive study of the seventeen elements of Pythagorean triangles, from the point of view of when such an element is an irrational number, a rational number, or an integer. For each of these 17 elements,precice conditions for…
We prove canonical and non-canonical tree-of-tangles theorems for abstract separation systems that are merely structurally submodular. Our results imply all known tree-of-tangles theorems for graphs, matroids and abstract separation systems…
In 1967 the Dutch mathemetician F.J.M. Barning described an infinite, planar, ternary tree*. Seven years later, A. Hall independently discovered the same tree. Both used the method of uni-modular matrices to transform one triple to another.…
This elementary note proposes candidates for interesting continuous piecewise-smooth `Riemannian' metrics on the moduli spaces of rooted geodesic trees embedded in the Poincar\'e disk. A related digression observes the existence of an…
The following article summarizes research where theorems and their respective demonstrations are postulated based on quadratic equations with special properties given by the Pythagorean triplets and the Fibonacci sequence given the second…
Tree-graded spaces are a generalization of $\mathbb{R}$-trees and play an important role in describing the large-scale geometry of relatively hyperbolic groups. We consider a subclass of tree-graded spaces that we call "disjointly…
Trialitarian triples are triples of central simple algebras of degree 8 with orthogonal involution that provide a convenient structure for the representation of trialitarian algebraic groups as automorphism groups. This paper explicitly…
A tanglegram consists of two binary rooted trees with the same number of leaves and a perfect matching between the leaves of the trees. We show that the two halves of a random tanglegram essentially look like two independently chosen random…
The modular decomposition of a symmetric map $\delta\colon X\times X \to \Upsilon$ (or, equivalently, a set of symmetric binary relations, a 2-structure, or an edge-colored undirected graph) is a natural construction to capture key features…
New formulas for the construction of Pythagorean triples and generalizations to equations of higher powers. Application of formulas to some problems, in particular Fermat's equation with n=4.