Related papers: Forest-skein groups III: simplicity

A near-group category is an additively semisimple category with a product such that all but one of the simple objects is invertible. We classify braided structures on near-group categories, and give explicit numerical formulas for their…

In [Akbari and Moghaddamfar, Recognizing by order and degree pattern of some projective special linear groups, {\it Internat. J. Algebra Comput.}, 2012] the authors possed the following problem: \\ {\bf Problem.} {\it Is there a simple…

Structure monoids and groups are algebraic invariants of equational varieties. We show how to construct presentations of these objects from coherent categorifications of equational varieties, generalising several results of Dehornoy. We…

Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties. Firstly, we prove that being finitely…

The groups QF, QT, and QV are groups of quasi-automorphisms of the infinite binary tree. Their names indicate a similarity with Thompson's well-known groups F, T, and V. We will use the theory of diagram groups over semigroup presentations…

We define the braid groups of a two-dimensional orbifold and introduce conventions for drawing braid pictures. We use these to realize the Artin groups associated to the spherical Coxeter diagrams A_n, B_n=C_n and D_n and the affine…

We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…

We introduce the notion of mixed subtree quasi-isometries, which are self quasi-isometries of regular trees built in a specific inductive way. We then show that any self quasi-isometry of a regular tree is at bounded distance from a…

We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is a cone over such a structure. We show that a simplicial tree…

We propose a new optimization-based approach for feature selection in tree ensembles, an important problem in statistics and machine learning. Popular tree ensemble toolkits e.g., Gradient Boosted Trees and Random Forests support feature…

We consider the Thompson-Stein group F(n_1,...,n_k) for integers n_1,...,n_k and k greater than 1. We highlight several differences between the cases k=1$ and k>1, including the fact that minimal tree-pair diagram representatives of…

We define a family of groups that generalises Thompson's groups $T$ and $G$ and also those of Higman, Stein and Brin. For groups in this family we descrine centralisers of finite subgroups and show, that for a given finite subgroup $Q$,…

We prove that the Brin-Thompson groups sV, also called higher dimensional Thompson's groups, are of type F_\infty for all natural numbers s. This result was previously shown for s up to 3, by considering the action of sV on a naturally…

We provide a family of generating sets $S_{\alpha}$ of the Higman--Thompson groups $V_n$ that are parametrized by certain sequences $\alpha$ of elements in $V_n$. These generating sets consist of $3$ involutions $\sigma$, $\tau$, and…

We prove simplicity for incomplete rank 2 Kac-Moody groups over algebraic closures of finite fields with trivial commutation relations between root groups corresponding to prenilpotent pairs. We don't use the (yet unknown) simplicity of the…

A remarkable result of Thompson states that a finite group is soluble if and only if its two-generated subgroups are soluble. This result has been generalized in numerous ways, and it is in the core of a wide area of research in the theory…

We prove that the only finite factor-representations of the Higman-Thompson groups $\{F_{n,r}\}$, $ \{G_{n,r}\}$ are the regular representations and scalar representations arising from group abelianizations. As a corollary, we obtain that…

We consider weighted generating functions of trees where the weights are products of functions of the sizes of the subtrees. This work begins with the observation that three different communities, largely independently, found substantially…

We prove that every simple polygon contains a degree 3 tree encompassing a prescribed set of vertices. We give tight bounds on the minimal number of degree 3 vertices. We apply this result to reprove a result from Bose et al. that every set…

The authors classify the finite index subgroups of R. Thompson's group $F$. All such groups that are not isomorphic to $F$ are non-split extensions of finite cyclic groups by $F$. The classification describes precisely which finite index…