Related papers: Forest-skein groups III: simplicity

The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific family of…

We give several new positive finite presentations for the pure braid group that are easy to remember and simple in form. All of our presentations involve a metric on the punctured disc so that the punctures are arranged "convexly", which is…

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…

It is a simple fact that a group has a trivial automorphism group if and only if it is of order $1$ or $2$. We prove that the same holds for certain families of skew braces, and given any odd prime $p$, we construct a skew brace of order…

We classify all simple transitive $2$-representations for two classes of finitary $2$-categories associated with tree path algebras and also for one class of fiat $2$-categories associated with truncated polynomial rings. Additionally, we…

We solve the isomorphism problem for braid groups on trees with $n = 4$ or 5 strands. We do so in three main steps, each of which is interesting in its own right. First, we establish some tools and terminology for dealing with computations…

For a finite group $G$, let $\sigma(G)$ be the number of subgroups of $G$ and $\sigma_\iota(G)$ the number of isomorphism types of subgroups of $G$. Let $L=L_r(p^e)$ denote a simple group of Lie type, rank $r$, over a field of order $p^e$…

We consider actions of completely metrisable groups on simplicial trees in the context of the Bass--Serre theory. Our main result characterises continuity of the amplitude function corresponding to a given action. Under fairly mild…

Let $\FN$ be a free group of finite rank $N \geq 2$, and let $T$ be an $\R$-tree with a very small, minimal action of $\FN$ with dense orbits. For any basis $\CA$ of $\FN$ there exists a {\em heart} $K_{\CA} \subset \bar T$ (= the metric…

Garside groups are combinatorial generalizations of braid groups which enjoy many nice algebraic, geometric, and algorithmic properties. In this article we propose a method for turning the direct product of a group $G$ by $\mathbb{Z}$ into…

The groups G_{k,1} of Richard Thompson and Graham Higman can be generalized in a natural way to monoids, that we call M_{k,1}, and to inverse monoids, called Inv_{k,1}; this is done by simply generalizing bijections to partial functions or…

We describe how an Ore category with a Garside family can be used to construct a classifying space for its fundamental group(s). The construction simultaneously generalizes Brady's classifying space for braid groups and the Stein--Farley…

There are familiar examples of computable structures having various computable Scott ranks. There are also familiar structures, such as the Harrison ordering, which have Scott rank $\omega_1^{CK}+1$. Makkai produced a structure of Scott…

We introduce the notion of the $k$-closure of a group of automorphisms of a locally finite tree, and give several examples of the construction. We show that the $k$-closure satisfies a new property of automorphism groups of trees that…

We study the group $QV$, the self-maps of the infinite $2$-edge coloured binary tree which preserve the edge and colour relations at cofinitely many locations. We introduce related groups $QF$, $QT$, $\tilde{Q}T$, and $\tilde{Q}V$, prove…

We use the Bateman--Horn Conjecture from number theory to give strong evidence of a positive answer to Peter Neumann's question, whether there are infinitely many simple groups of order a product of six primes. (Those with fewer than six…

Tree ensembles, such as random forests and boosted trees, are renowned for their high prediction performance. However, their interpretability is critically limited due to the enormous complexity. In this study, we present a method to make a…

Let $C$ be a smooth, projective and geometrically connected curve defined over a finite field $\mathbb{F}_q(C)$. Given a semisimple $C-S$-group scheme $\underline{G}$ where $S$ is a finite set of closed points of $C$, we describe the set of…

We generalize the Brin-Higman-Thompson groups $n G_{k,1}$ to monoids $n M_{k,1}$, for $n \ge 1$ and $k \ge 2$, by replacing bijections by partial functions. The monoid $n M_{k,1}$ has $n G_{k,1}$ as its group of units, and is…

We introduce and analyze parallelizable algorithms to compress and accurately reconstruct finite simplicial complexes that have non-trivial automorphisms. The compressed data -- called a complex of groups -- amounts to a functor from (the…