Related papers: The Modular Tree of Pythagorus
A rooted tree module (RTM) $M:=M(T,F)$ over a zero-relation algebra $\Lambda:=\mathcal KQ/\langle\rho\rangle$ over a field $\mathcal K$ is given by the data of a quiver morphism $F:T\to Q$ from a rooted tree $T$ (either with a source or a…
This is a short exposition--mostly by way of the toy models ``double logarithm'' and ``triple logarithm''--which should serve as an introduction to a forthcoming article in which we establish a connection between multiple polylogarithms,…
The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have…
Generalizing the decomposition of a connected planar graph into a tree and a dual tree, we prove a combinatorial analog of the classic Helmholz-Hodge decomposition of a smooth vector field. Specifically, we show that for every polyhedral…
We construct explicitly groups associated to specific ternary algebras which extend the Lie (super)algebras (called Lie algebras of order three). It turns out that the natural variables which appear in this construction are variables which…
Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of…
Lorea [11] and later Frank et al. [8] generalized graphic matroids to hypergraphic matroids. In [8], the authors introduced hypertrees as a generalization of spanning trees and proved a form of the theorem of Tutte [18] and Nash-Williams…
Tanglegrams are a special class of graphs appearing in applications concerning cospeciation and coevolution in biology and computer science. They are formed by identifying the leaves of two rooted binary trees. We give an explicit formula…
In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…
We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…
Phylogenetic trees are binary nonplanar trees with labelled leaves, and plane oriented recursive trees are planar trees with an increasing labelling. Both families are enumerated by double factorials. A bijection is constructed, using the…
Modular operads are a special type of operad: in fact, they bear the same relationship to operads that graphs do to trees (i.e. simply connected graphs). One of the basic examples of a modular operad is the collection of…
The family of trees with palindromic characteristic polynomials is characterized. Large families of graphs with this property are found as well.
We define the triple Riordan group, whose elements consist of $4$-tuples of power series $(g, f_1, f_2, f_3)$ with $g\in \mathbf{R}[[x^3]]$, and $f_1, f_2, f_3 \in x\mathbf{R}[[x^3]]$, for an appropriate ring $\mathbf{R}$. The construction…
A split-by-edges tree of a graph G on n vertices is a binary tree T where the root = V(G), every leaf is an independent set in G, and for every other node N in T with children L and R there is a pair of vertices {u, v} in N such that L = N…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
We describe triples and systems, expounded as an axiomatic algebraic umbrella theory for classical algebra, tropical algebra, hyperfields, and fuzzy rings.
The Babylonian graph B has the positive integers as vertices and connects two if they define a Pythagorean triple. Triangular subgraphs correspond to Euler bricks. What are the properties of this graph? Are there tetrahedral subgraphs…
We show that every structurally submodular separation system admits a canonical tree set which distinguishes its tangles.
The sequence A120986 in the Encyclopedia of Integer Sequences counts ternary trees according to the number of nodes and the number of middle edges. Using a certain substition, the underlying cubic equation can be factored. This leads to an…