相关论文: The Modular Tree of Pythagorus

The $E_8$ root lattice can be constructed from the modular curve $X(13)$ by the invariant theory for the simple group $\text{PSL}(2, 13)$. This gives a different construction of the $E_8$ root lattice. It also gives an explicit construction…

Using Cayley graphs and Clifford algebras, we are able to give, for every finitely generated groups, a uniform construction of spectral triples with a generically non-trivial phase for the Dirac operator. Unfortunatly $D_{+}$ is index $0$,…

We investigate the tree gonality of a genus-$g$ metric graph, defined as the minimum degree of a tropical morphism from any tropical modification of the metric graph to a metric tree. We give a combinatorial constructive proof that this…

To any free group automorphism, we associate a real pretree with several nice properties. First, it has a rigid/non-nesting action of the free group with trivial arc stabilizers. Secondly, there is an expanding pretree-automorphism of the…

A bundle gerbe is constructed from an oriented smooth vector bundle of even rank with a fiberwise inner product, over a compact connected orientable smooth manifold with Riemannian metric. From a trivialization of the bundle gerbe is…

Let $A$ be a noetherian ring and $R_A$ be the graded ring $A[X,Y,Z,T]$. In this article we introduce the notion of a triad, which is a generalization to families of curves in ${\bf P}^3_A$ of the notion of Rao module. A triad is a complex…

Higher genus modular graph tensors map Feynman graphs to functions on the Torelli space of genus-$h$ compact Riemann surfaces which transform as tensors under the modular group $Sp(2h , \mathbb Z)$, thereby generalizing a construction of…

Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of…

A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…

To construct ternary "quaternions" following Hamilton we must introduce two "imaginary "units, $q_1$ and $q_2$ with propeties $q_1^n=1$ and $q_2^m=1$. The general is enough difficult, and we consider the $m=n=3$. This case gives us the…

The polytope structure of the associahedron is decomposed into two categories, types and classes. The classification of types is related to integer partitions, whereas the classes present a new combinatorial problem. We solve this and…

For a zero-relation algebra over a field $\mathcal K$, Crawley-Boevey introduced the concept of a tree module and provided a combinatorial description of a basis for the space of homomorphisms between two tree modules--the basis elements…

This chapter describes interrelations between: (1) algebraic structure on sets of scalars, (2) properties of monads associated with such sets of scalars, and (3) structure in categories (esp. Lawvere theories) associated with these monads.…

We introduce and study a notion of decomposition of planar point sets (or rather of their chirotopes) as trees decorated by smaller chirotopes. This decomposition is based on the concept of mutually avoiding sets (which we rephrase as…

Using the Lagrange inversion formula, $t$-ary trees are enumerated with respect to edge type (left, middle, right for ternary trees).

Links in $S^3$ as well as Legendrian links in the standard tight contact structure on $S^3$ can be encoded by grid diagrams. These consist of a collection of points on a toroidal grid, connected by vertical and horizontal edges. Blackwell,…

It is shown that a flat subgroup, $H$, of the totally disconnected, locally compact group $G$ decomposes into a finite number of subsemigroups on which the scale function is multiplicative. The image, $P$, of a multiplicative semigroup in…

We develop a notion of groups that act acylindrically and non-elementarily on simplicial trees, which we call acylindrically arboreal groups. We then prove a complete classification of when graph products of groups and the fundamental…

A caterpillar tree is a connected, acyclic, graph in which all vertices are either a member of a central path, or joined to that central path by a single edge. In other words, caterpillar trees are the class of trees which become path…

Description of cocommutative Hopf algebras associated with families of trees. Applications include Cayley's theorem on the number of rooted trees with n nodes, and Catalan's theorem on the number of rooted ordered trees with n nodes.