Related papers: Forest-skein groups III: simplicity

This article is an expanded version of the talks given by the authors at the Arbeitsgemeinschaft "Totally Disconnected Groups", held at Oberwolfach in October 2014. We recall the basic theory of automorphisms of trees and Tits' simplicity…

We study the subgroup of $k$-automorphisms of $k[x,y]$ which commute with a simple derivation $D$ of $k[x,y].$ We prove, for example, that this subgroup is trivial when $D$ is a Shamsuddin simple derivation. In the general case of simple…

We prove new results about the remarkable infinite simple groups introduced by Richard Thompson in the 1960s. We define the groups as partial transformation groups and we give a faithful representation in the Cuntz C*-algebra. For the…

We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…

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…

A number of properties of spherical Artin groups extend to Garside groups, defined as the groups of fractions of monoids where least common multiples exist, there is no nontrivial unit, and some additional finiteness conditions are…

In 1966, Cummins introduced the "tree graph": the tree graph $\mathbf{T}(G)$ of a graph $G$ (possibly infinite) has all its spanning trees as vertices, and distinct such trees correspond to adjacent vertices if they differ in just one edge,…

Schmith\"usen proved in 2004 that the Veech group of an origami is closely related to a subgroup of the automorphism group of the free group $F_2$. This result is significant in the sense that the framework of approachable Veech groups is…

The in-order traversal provides a natural correspondence between binary trees with a decreasing vertex labeling and endofunctions on a finite set. By suitably restricting the vertex labeling we arrive at a class of trees that we call…

When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in…

Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…

The degree pattern of a finite group is the degree sequence of its prime graph in ascending order of vertices. We say that the problem of OD-characterization is solved for a finite group if we determine the number of pairwise nonisomorphic…

The theory of $k$-regular graphs is closely related to group theory. Every $k$-regular, bipartite graph is a Schreier graph with respect to some group $G$, a set of generators $S$ (depending only on $k$) and a subgroup $H$. The goal of this…

This paper introduces a data structure, called simplex tree, to represent abstract simplicial complexes of any dimension. All faces of the simplicial complex are explicitly stored in a trie whose nodes are in bijection with the faces of the…

We review efforts in string model building, focusing on the heterotic orbifold compactifications. We survey how one can, starting from an explicit string theory, obtain models which resemble Nature. These models exhibit the standard model…

This is the fifth one in a series of papers classifying the factorizations of almost simple groups with nonsolvable factors. In this paper we deal with orthogonal groups of plus type.

Motivated by Burillo, Cleary and Roever's summary on obstructions of subgroups of Thompson's group $V,$ we explored the higher dimensional version of the groups, Brin-Thompson groups $nV$ and $SV,$ a class of infinite dimensional…

This article is dedicated to the study of asymptotically rigid mapping class groups of infinitely-punctured surfaces obtained by thickening planar trees. Such groups include the braided Ptolemy-Thompson groups $T^\sharp,T^\ast$ introduced…

In this paper, we introduce the notion of Cartesian Forest, which generalizes Cartesian Trees, in order to deal with partially ordered sequences. We show that algorithms that solve both exact and approximate Cartesian Tree Matching can be…

Closed subgroups of the group of isometries of the regular tree $\treeq$ that fix an end of the tree and are vertex-transitive are shown to correspond, on one hand, to self-replicating groups acting on rooted trees and, on the other hand,…