Related papers: A Cantor-Bendixson Rank for Siblings of Trees
We solve the isomorphism problem for braid groups on trees with $n = 4$ or 5 strands. We do so in three main steps, each of which is interesting in its own right. First, we establish some tools and terminology for dealing with computations…
Let $\FN$ be a free group of finite rank $N \geq 2$, and let $T$ be an $\R$-tree with a very small, minimal action of $\FN$ with dense orbits. For any basis $\CA$ of $\FN$ there exists a {\em heart} $K_{\CA} \subset \bar T$ (= the metric…
Processing sentence constituency trees in binarised form is a common and popular approach in literature. However, constituency trees are non-binary by nature. The binarisation procedure changes deeply the structure, furthering constituents…
By a tensor we mean an element of a tensor product of vector spaces over a field. Up to a choice of bases in factors of tensor products, every tensor may be coordinatized, that is, represented as an array consisting of numbers. This note is…
Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…
Using the Lagrange inversion formula, $t$-ary trees are enumerated with respect to edge type (left, middle, right for ternary trees).
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…
Discovering the latent structure from many observed variables is an important yet challenging learning task. Existing approaches for discovering latent structures often require the unknown number of hidden states as an input. In this paper,…
Decision trees have been widely used as classifiers in many machine learning applications thanks to their lightweight and interpretable decision process. This paper introduces Tree in Tree decision graph (TnT), a framework that extends the…
Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We…
For an arbitrary commutative ring k and t in k, we construct a 2-functor S_t which sends a tensor category to a new tensor category. By applying it to the representation category of a bialgebra we obtain a family of categories which…
A ternary complex tree related to the golden ratio is used to show how the theory of complex trees works. We use the topological set of this tree to obtain a parametric family of trees in one complex variable. Even though some real ferns…
A space X is called an alpha-Toronto space if X is scattered of Cantor-Bendixson rank alpha and is homeomorphic to each of its subspaces of same rank. We answer a question of Steprans by constructing a countable alpha-Toronto space for each…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
Given a tract $F$ in the sense of Baker and Bowler and a matrix $A$ with entries in $F$, we define several notions of rank for $A$. In this way, we are able to unify and find conceptually satisfying proofs for various results about ranks of…
We prove a lower bound on the rank of tensors constructed from families of linear maps that `expand' the dimension of every subspace. Such families, called {\em dimension expanders} have been studied for many years with several known…
In this paper, we provide algorithms to rank and unrank certain degree-restricted classes of Cayley trees (spanning trees of the n-vertex complete graph). Specifically, we consider classes of trees that have a given set of leaves or a fixed…
Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…
The degree distribution of an ordered tree $T$ with $n$ nodes is $\vec{n} = (n_0,\ldots,n_{n-1})$, where $n_i$ is the number of nodes in $T$ with $i$ children. Let $\mathcal{N}(\vec{n})$ be the number of trees with degree distribution…
In this paper we further develop the theory of matrices over the extended tropical semiring. Introducing a notion of tropical linear dependence allows for a natural definition of matrix rank in a sense that coincides with the notions of…