Related papers: Invariable generation of certain branch groups

We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

We find a set of generators for the automorphism group of a graph product of finitely generated abelian groups entirely from a certain labeled graph. In addition, we find generators for the important subgroup of star-automorphisms defined…

A group $G$ is said to be $\frac{3}{2}$-generated if every nontrivial element belongs to a generating pair. It is easy to see that if $G$ has this property then every proper quotient of $G$ is cyclic. In this paper we prove that the…

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components each containing a cycle. If $\Gamma$ has a…

We first show that a class of pro-$p$ branch groups including the Grigorchuk group and the Gupta-Sidki groups all have subgroup growth type $n^{\log n}$. We then introduce the notion of orbit growth and use it to construct extensions of the…

There are a variety of ways to associate directed or undirected graphs to a group. It may be interesting to investigate the relations between the structure of these graphs and characterizing certain properties of the group in terms of some…

The existence of an infinite simple boundedly generated 2-generated group and the existence of a boundedly simple 2-generated group containing a free non-cyclic subgroup are proved.

We prove a result on the asymptotic proportion of randomly chosen pairs of permutations in the symmetric group $S_n$ which "invariably" generate a nonsolvable subgroup, i.e., whose cycle structures cannot possibly both occur in the same…

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…

Based on the convergence of their infinitesimal generators in the mixed topology, we provide a stability result for strongly continuous convex monotone semigroups on spaces of continuous functions. In contrast to previous results, we do not…

We investigate families of graphs and graphons (graph limits) that are defined by a finite number of prescribed subgraph densities. Our main focus is the case when the family contains only one element, i.e., a unique structure is forced by…

Every finitely generated self-similar group naturally produces an infinite sequence of finite $d$-regular graphs $\Gamma_n$. We construct self-similar groups, whose graphs $\Gamma_n$ can be represented as an iterated zig-zag product and…

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

We show how to efficiently count and generate uniformly at random finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$ of a given isomorphism type. The method to achieve these results relies on a natural map of…

It is well known that every finite simple group can be generated by two elements and this leads to a wide range of problems that have been the focus of intensive research in recent years. In this survey article we discuss some of the…

Let $G$ be a finite group. Denoting by ${\rm{cd}}(G)$ the set of the degrees of the irreducible complex characters of $G$, we consider the {\it character degree graph} of $G$: this is the (simple, undirected) graph whose vertices are the…

We answer two longstanding questions of Klopsch (1999) and Shalev (2000) by proving that the finitely generated Hausdorff spectrum of the closure of a finitely generated regular branch group with respect to the level-stabilizer filtration…

Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…

We show that every countable subgroup $G<\rm GL_+(2,\mathbb{R})$ without contracting elements is the Veech group of a tame translation surface $S$ of infinite genus, for infinitely many different topological types of $S$. Moreover, we prove…

We verify that every alternating group of degree at most one quadrillion is invariably generated by an element of prime order together with an element of prime power order.