Related papers: A disjoint union theorem for trees

We analyze the interplay between labeled trees and the ultrametric spaces they present. We provide characterizations of labeled trees that generate separable ultrametric spaces and those that generate locally finite ultrametric spaces. In…

We describe an error in the proof of a key proposition, which was necessary for the proof of the main result. Alternate proofs of the main result are given by Ozsvath-Stipsicz-Szabo and Dai-Hom-Stoffregen-Truong.

Consider the generalized iterated wreath product $S_{r_1}\wr \ldots \wr S_{r_k}$ of symmetric groups. We give a complete description of the traversal for the generalized iterated wreath product. We also prove an existence of a bijection…

Let $n>1$ be an integer, and let $T$ be a tree with $n+1$ vertices $v_1,\ldots,v_{n+1}$, where $v_1$ and $v_{n+1}$ are two leaves of $T$. For each edge $e$ of $T$, assign a complex number $w(e)$ as its weight. We obtain that…

Let $G$ be a finite group. K. Harada conjectured that the product of degrees of all irreducible characters of $G$ divides the product of lengths of all conjugacy classes of $G$. We verify this conjecture for finite general linear groups and…

We prove the so-called Unitary Isotropy Theorem, a result on isotropy of a unitary involution. The analogous previously known results on isotropy of orthogonal and symplectic involutions as well as on hyperbolicity of orthogonal,…

In this sequel to arxiv:arXiv:1012.0835 we develop Bezout type theorems for semidegrees (including an explicit formula for {\em iterated semidegrees}) and an inequality for subdegrees. In addition we prove (in case of surfaces) a Bernstein…

We prove a global uniform Artin-Rees lemma type theorem for sections of ample line bundles over smooth projective varieties. This result is used to prove an Artin-Rees lemma for the polynomial ring with uniform degree bounds. The proof is…

We give a descriptive construction of trees for multi-ended graphs, which yields yet another proof of Stallings' theorem on ends of groups. Even though our proof is, in principle, not very different from already existing proofs and it draws…

Disjoint-Set forests, consisting of Union-Find trees, are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact structural characterization of these trees is known (such a…

We give a combinatorial proof of a recent result of B\'ona by constructing a bijection from the set of all neighbors of leaves of increasing trees of size $n$ to the set of derangements of length $n$.

We prove a mixed joint discrete universality theorem for a Matsumoto zeta-function $\varphi(s)$ (belonging to the Steuding subclass) and a periodic Hurwitz zeta-function $\zeta(s,\alpha;{\mathfrak{B}})$. For this purpose, certain…

Let T be a rooted tree and Iso(T) be the group of isometries of T. Using model-theoretic tools we study closed subgroups G of Iso(T) with respect to the number of conjugacy classes of Iso(T) having representatives in G.

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.…

A skeleton of the category with finite coproducts D freely generated by a single object has a subcategory isomorphic to a skeleton of the category with finite products C freely generated by a countable set of objects. As a consequence, we…

In this paper we prove several theorems about the behavior of index of Lie algebras derived from associative algebras under tensor products of underlying associative algebras.

We construct a homotopy initial functor from the partition complex of a finite set $A$ to a category of trees with leaves labelled by $A$. As an application, this provides an equivalence between different bar constructions of an operad. In…

We prove that every finite distributive lattice is isomorphic to a final segment of the d.c.e. Turing degrees (i.e., the degrees of differences of computably enumerable sets). As a corollary, we are able to infer the undecidability of the…

In this paper we show an index theorem for gerbes

We give an algorithm for computing the Teichm\"uller polynomial for a certain class of fibered alternating links associated to trees. Furthermore, we exhibit a mutant pair of such links distinguished by the Teichm\"uller polynomial.