Related papers: Strongly transitive multiple trees

Given a transitive permutation group, a fundamental object for studying its higher transitivity properties is the permutation action of its isotropy subgroup. We reverse this relationship and introduce a universal construction of infinite…

We show that any free product of two countable groups, one of them being infinite, admits a faithful and homogeneous action on the Random Graph. We also show that a large class of HNN extensions or free products, amalgamated over a finite…

We prove that a permutation group in which different finite sets have different stabilizers cannot satisfy any group law. For locally compact topological groups with this property we show that almost all finite subsets of the group generate…

Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…

We generalize the notion of tight geodesics in the curve complex to tight trees. We then use tight trees to construct model geometries for certain surface bundles over graphs. This extends some aspects of the combinatorial model for doubly…

We demonstrate the versatility of the tangle-tree duality theorem for abstract separation systems by using it to prove tree-of-tangles theorems. This approach allows us to strengthen some of the existing tree-of-tangles theorems by bounding…

Let X be an algebraic variety covered by open charts isomorphic to the affine space and q: X' \to X be the universal torsor over X. We prove that the automorphism group of the quasiaffine variety X' acts on X' infinitely transitively. Also…

We show that the class of amalgamated free products of two free groups over a cyclic subgroup admits amenable, faithful and transitive actions on infinite countable sets. This work generalizes the results on such actions for doubles of free…

We work with attracting subshifts generated by substitutions which are also irreducible parageometric automorphisms of free groups. For such a dynamical system, we construct a tree substitution to approximate the repelling real tree of the…

We study unirational algebraic varieties and the fields of rational functions on them. We show that after adding a finite number of variables some of these fields admit an infinitely transitive model. The latter is an algebraic variety with…

We investigate the profinite completions of a certain family of groups acting on trees. It turns out that for some of the groups considered, the completions coincide with the closures of the groups in the full group of tree automorphisms.…

We prove that a finitely generated pro-$p$ group $G$ acting on a pro-$p$ tree $T$ splits as a free amalgamated pro-$p$ product or a pro-$p$ HNN-extension over an edge stabilizer. If $G$ acts with finitely many vertex stabilizers up to…

We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.

We characterize the ``best'' model geometries for the class of virtually free groups, and we show that there is a countable infinity of distinct ``best'' model geometries in an appropriate sense--these are the maximally symmetric trees. The…

It is known that if the special automorphism group $\text{SAut}(X)$ of a quasiaffine variety $X$ of dimension at least $2$ acts transitively on $X$, then this action is infinitely transitive. In this paper we address the question whether…

This paper will show when a rooted path tree of a finite directed rooted graph has only finitely many orbits under the action of its undirected automorphism group (i.e. when it is cocompact). This will allow us to specify which trees are…

We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…

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

We show that several new classes of groups are measure strongly treeable. In particular, finitely generated groups admitting planar Cayley graphs, elementarily free groups, and the group of isometries of the hyperbolic plane and all its…

We describe an underlying right angled building structure of any graph product of buildings. We describe the automorphism group of the graph product of buildings. We show that the notion of generalized graph product of a collection of…