Related papers: On treeings arising from HNN extensions
The group of extensions (as in the title), endowed with something like a connection at Archimedean infinity, is isomorphic to the ad\'ele-class group of $\Q$: which is a topological group with interesting Haar measure.}
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…
Let $G$ be a discrete countable group and $C$ its central subgroup with $G/C$ treeable. We show that for any treeable action of $G/C$ on a standard probability space $X$, the groupoid $G\ltimes X$ is isomorphic to the direct product of $C$…
This is an addendum to arXiv: 0810.5376. We show, using our methods and an auxiliary result of Bestvina-Bromberg-Fujiwara, that a finitely generated group with infinitely many pairwise non-conjugate homomorphisms to a mapping class group…
In this paper we examine planted binary plane trees. First, we provide an exact formula for the number of planted binary trees with given Horton-Strahler orders. Then, using the notion of entropy, we examine the structural complexity of…
In this article a collection of random self-similar fractal dendrites is constructed, and their Hausdorff dimension is calculated. Previous results determining this quantity for random self-similar structures have relied on geometrical…
The main focus of this contribution is on the harmonic Bergman spaces $\mathcal{B}_{\alpha}^{p}$ on the $q$-homogeneous tree $\mathfrak{X}_q$ endowed with a family of measures $\sigma_\alpha$ that are constant on the horocycles tangent to a…
We consider various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions concerning the unary nodes or abstractions, respectively: We…
Each natural number can be associated with some tree graph. Namely, a natural number $n$ can be factorized as $$ n = p_1^{\alpha_1}\ldots p_k^{\alpha_k},$$ where $p_i$ are distinct prime numbers. Since $\alpha_i$ are naturals, they can be…
Surjective homological epimorphisms with stratifying kernel can be used to construct recollements of derived module categories. These `stratifying' recollements are derived from recollements of module categories. Can every recollement be…
We define decision trees for monotone functions on a simplicial complex. We define homology decidability of monotone functions, and show that various monotone functions related to semimatroids are homology decidable. Homology decidability…
In a type-theoretic fibration category in the sense of Shulman (representing a dependent type theory with at least 1, Sigma, Pi, and identity types), we define the type of constant functions from A to B. This involves an infinite tower of…
The theme of this article is the algebraic combinatorics of leaf-labeled rooted binary trees and forests of such trees. The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees.…
We build a theory of binary trees on finite multisets that categorifies, or operationalizes, the entropy of a finite probability distribution. Multisets operationalize probabilities as the event outcomes of an experiment. Huffman trees…
We exhibit a monoidal structure on the category of finite sets indexed by P-trees for a finitary polynomial endofunctor P. This structure categorifies the monoid scheme (over Spec N) whose semiring of functions is (a P-version of) the…
We present a graph theoretical approach to the configurational statistics of random tree-like objects, such as randomly branching polymers. In particular, for ideal trees we show that Pr\"ufer labelling provides: (i) direct access to the…
The Poisson boundary of a finite direct product of affine automorphism groups of homogeneous trees is considered. The Poisson boundary is shown to be a product of ends of trees with a hitting measure for spread-out, aperiodic measures of…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
Tree-graded spaces are generalizations of R-trees. They appear as asymptotic cones of groups (when the cones have cut points). Since many questions about endomorphisms and automorphisms of groups, solving equations over groups, studying…
We define a class of invariants, which we call homological invariants, for persistence modules over a finite poset. Informally, a homological invariant is one that respects some homological data and takes values in the free abelian group…