Related papers: Growing trees from compact subgroups

Given a graph $G$ and a digraph $D$ whose vertices are the edges of $G$, we investigate the problem of finding a spanning tree of $G$ that satisfies the constraints imposed by $D$. The restrictions to add an edge in the tree depend on its…

Suppose an amenable group $G$ is acting freely on a simply connected simplicial complex $\tilde X$ with compact quotient $X$. Fix $n \geq 1$, assume $H_n(\tilde X, \mathbb{Z})=0$ and let $(H_i)$ be a Farber chain in $G$. We prove that the…

Let G be a totally disconnected, locally compact group admitting a contractive automorphism f. We prove a Jordan-Holder theorem for series of f-stable closed subgroups of G, classify all possible composition factors and deduce consequences…

This paper is about the structure of infinite primitive permutation groups and totally disconnected locally compact groups ("tdlc groups'"). The permutation groups we investigate are subdegree-finite (i.e. all orbits of point stabilisers…

We provide sufficient conditions for the multi-EGS groups to be liftable and thus produce new examples of groups acting transitively on regular trees of finite degree stabilizing one of the ends, whose closures are scale groups as defined…

In this paper, we introduce a new depicting of the so-called numerical semigroup tree $\mathcal T$. By exploring computationally this improved picture, relying on the type notion of a semigroup, we found that the number of semigroups of…

Let G be a finitely generated group. Two simplicial G-trees are said to be in the same deformation space if they have the same elliptic subgroups (if H fixes a point in one tree, it also does in the other). Examples include…

Non-wellfounded proof systems impose a global condition called the global trace condition (GTC) on a derivation tree to ensure soundness. Providing a categorical characterisation of the GTC that guarantees soundness remains challenging due…

We prove that locally countably-compact Hausdorff topological groups $\mathbb{G}$ act continuously on their iterated joins $E_n\mathbb{G}:=\mathbb{G}^{*(n+1)}$ (the total spaces of the Milnor-model $n$-universal $\mathbb{G}$-bundles) as…

If $G$ is a group acting on a tree $X$, and ${\mathcal S}$ is a $G$-equivariant sheaf of vector spaces on $X$, then its compactly-supported cohomology is a representation of $G$. Under a finiteness hypothesis, we prove that if $H_c^0(X,…

Let $G$ be a $3$-connected graph with a $3$-connected (or sufficiently small) simple minor $H$. We establish that $G$ has a forest $F$ with at least $\left\lceil(|G|-|H|+1)/2\right\rceil$ edges such that $G/e$ is $3$-connected with an…

In this paper we consider the re-expansion problems on compact Lie groups. First, we establish weighted versions of classical re-expansion results in the setting of multi-dimensional tori. A natural extension of the classical re-expansion…

If $G$ is a strongly connected finite directed graph, the set $\mathcal{T}G$ of rooted directed spanning trees of $G$ is naturally equipped with a structure of directed graph: there is a directed edge from any spanning tree to any other…

In this paper we give sufficient conditions under which a subsemigroup of a topological group is a subgroup, adding to the results given in \cite{Kosh, can, axioms, forum, Hof, cc, locally} where conditions exist (such as locally…

We introduce the notion of an introverted Boolean algebra $\cal B$ of closed-and-open subsets of a topological group $G$, show that the associated Stone space $(\nu_{\cal B} G, \nu_{\cal B})$ is a totally disconnected semigroup…

We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree. We take such connectivity to be induced by the…

We show that if $\kappa \leq \omega$ and there exists a group topology without non-trivial convergent sequences on an Abelian group $H$ such that $H^n$ is countably compact for each $n<\kappa$ then there exists a topological group $G$ such…

We define an algorithm k which takes a connected graph G on a totally ordered vertex set and returns an increasing tree R (which is not necessarily a subtree of G). We characterize the set of graphs G such that k(G)=R. Because this set has…

For any order of growth $f(n)=o(\log n)$ we construct a finitely-generated group $G$ and a set of generators $S$ such that the Cayley graph of $G$ with respect to $S$ supports a harmonic function with growth $f$ but does not support any…

We introduce a graph partitioning problem motivated by computational topology and propose two algorithms that produce approximate solutions. Specifically, given a weighted, undirected graph $G$ and a positive integer $k$, we desire to find…