Related papers: Forest-skein groups III: simplicity

Let $V_r(\Sigma)$ be the generalised Thompson group defined as the automorphism group of a valid, bounded, and complete Cantor algebra. We show that that for every $n>0$ there is a $k>n,$ such that there exists a $k$-dimensional…

For each skein module we describe a homology theory which, for any three manifold recovers the skein module at its zero level. The theory measures skein-like relations among skein relations, mimicking Hilbert's theory of syzygies. We work…

We give sufficient conditions for left- and bi-orderability of fundamental groups of Ore categories in terms of indirect factors, including Thompson groups and many of their generalizations. Besides recovering known results, we prove that…

The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have definable Skolem functions (by a monadic formula with…

We give a short proof that every contracting self-similar group embeds into a finitely presented simple group. In particular, any contracting self-similar group embeds into the corresponding R\"over--Nekrashevych group, and this in turn…

We give a structural description of the normal subgroups of subgroups of finite index in branch groups in terms of rigid stabilizers. This gives further insight into the structure lattices of branch groups introduced by the second author.…

Stanley introduced the concept of chromatic symmetric functions of graphs which extends and refines the notion of chromatic polynomials of graphs, and asked whether trees are determined up to isomorphism by their chromatic symmetric…

Given a finite group $G$ and its representation $\rho$, the corresponding McKay graph is a graph $\Gamma(G,\rho)$ whose vertices are the irreducible representations of $G$; the number of edges between two vertices $\pi,\tau$ of…

Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…

The overlap graphs of subtrees in a tree (SOGs) generalise many other graphs classes with set representation characterisations. The complexity of recognising SOGs in open. The complexities of recognising many subclasses of SOGs are known.…

We prove that the braided Thompson's groups $V_{\rm br}$ and $F_{\rm br}$ are of type $F_\infty$, confirming a conjecture by John Meier. The proof involves showing that matching complexes of arcs on surfaces are highly connected. In an…

We deduce a structurally inductive description of the determinantal probability measure associated with Kalai's celebrated enumeration result for higher--dimensional spanning trees of the $n-1$--simplex. As a consequence, we derive the…

We include a class of generalisations of Thompson's group $V$ introduced by Melanie Stein into the growing framework of topological full groups. Like $V$, Stein's groups can be described as certain piecewise linear maps with prescribed…

Irreducible Artin groups of finite type can be parametrized via their associated Coxeter diagrams into six sporadic examples and four infinite families, each of which is further parametrized by the natural numbers. Within each of these four…

Consider a tree $\mathbb T$, all whose vertices have countable valence; its boundary is the Baire space $\mathbb{B} \simeq\mathbb{N}^{\mathbb N}$; continued fractions expansions identify the set of irrational numbers $\mathbb{R}\setminus…

The last decade has shed some light on theoretical properties such as their consistency for regression tasks. In the current paper, we propose a new class of very simple learners based on so-called naive trees. These naive trees partition…

A fringe subtree of a rooted tree is a subtree induced by one of the vertices and all its descendants. We consider the problem of estimating the number of distinct fringe subtrees in two types of random trees: simply generated trees and…

We show that pure subgroups of infinitely braided Thompson's are bi-orderable. For every finitely generated pure subgroup, we give explicit sets of generators.

Let $G$ be a collineation group of a thick finite generalised hexagon or generalised octagon $\Gamma$. If $G$ acts primitively on the points of $\Gamma$, then a recent result of Bamberg et al. shows that $G$ must be an almost simple group…

Let $A$ be an elementary abelian $r$-group with rank at least $3$ that acts faithfully on the finite $r'$-group $G$. Assume that $G$ is $A$-simple, so that $G = K_{1} \times\cdots\times K_{n}$ where $K_{1},\ldots,K_{n}$ is a collection of…