Related papers: Minimal sofic shift on a group that is not finitel…

A finitely generated group or monoid is said to be context-free if it has context-free word problem. In this note, we give an example of a context-free monoid, none of whose maximal subgroups are finitely generated. This answers a question…

We present a proof of a result, previously announced by the second author, that there is a closed (even $\Pi^0_1$) set generating an $F_\sigma$ (even $\Sigma^0_2$) maximal cofinitary group (short, mcg) which is isomorphic to a free group.…

We show that a finitely generated soluble group is virtually nilpotent if and only if the diameter of its finite coset spaces admits a uniform polynomial lower bound in terms of their size. We obtain the same conclusion for certain finitely…

We prove that for arbitrary two finitely generated subgroups A and B having infinite index in a free group F, there is a subgroup H of finite index in B such that the subgroup generated by A and H has infinite index in F. The main corollary…

Brady proved that there are hyperbolic groups with finitely presented subgroups that are not of type $FP_3$ (and hence not hyperbolic). We reprove Brady's theorem by presenting a new construction. Our construction uses Bestvina-Brady Morse…

First, we answer a question of Pestov, by proving that the full group of a sofic equivalence relation is a sofic group. Then, we give a short proof of the theorem of Grigorchuk and Medynets that the topological full group of a minimal…

In the first section of this senior thesis the author provides some new efficient algorithms for calculating with finite permutation groups. They cannot be found in the computer algebra system MAGMA, but they can be implemented there. For…

A subset $S$ of a group $G$ invariably generates $G$ if $G= \langle s^{g(s)} | s \in S\rangle$ for every choice of $g(s) \in G,s \in S$. We say that a group $G$ is invariably generated if such $S$ exists, or equivalently if $S=G$ invariably…

The concept of a C-approximable group, for a class of finite groups C, is a common generalization of the concepts of a sofic, weakly sofic, and linear sofic group. Glebsky raised the question whether all groups are approximable by finite…

We introduce a notion of "local stability in permutations" for finitely generated groups. If a group is sofic and locally stable in our sense, then it is also locally embeddable into finite groups (LEF). Our notion is weaker than the…

We show that any topological, closed, oriented, non-spin $4$-manifold with fundamental group $\mathbb{Z}_{4k}$ and $\min(b_2^+, b_2^-)\geq 15$, has either none or infinitely many distinct smooth structures. Furthermore, we construct…

The goal of this article is to exhibit two new families of finitely generated simple groups of homeomorphisms of $\mathbf{R}$. These families are strikingly different from existing families owing to the nature of their actions on…

We study a class of generalisations of Thompson's group $V$ arising naturally as topological full groups of purely infinite, minimal groupoids. In the process, we show that the derived subgroup of such a group is 2-generated whenever it is…

The Lodha-Moore group $G$ first arose as a finitely presented counterexample to von Neumann's conjecture. The group $G$ acts on the unit interval via piecewise projective homemorphisms. A result of Lodha shows that $G$ in fact has type…

We obtain a minimal generating set of involutions for the level 2 subgroup of the mapping class group of a closed nonorientable surface.

In this paper we define Ordered Generating System for finite non-abelian groups, which is a generalization of the basis theorem for finite abelian groups. We prove the following: If each composition factor of a group G has Ordered…

Presenting a finite group by a free product of finite cyclic groups the Hopf formula for the Schur multiplier affords also a covering group, and this has minimal exponent provided that the order of the generators is preserved. This…

The shift graph is defined on the space of infinite subsets of natural numbers by letting two sets be adjacent if one can be obtained from the other by removing its least element. We show that this graph is not a minimum among the graphs of…

We introduce the concept of a type system~$\Part$, that is, a partition on the set of finite words over the alphabet~$\{0,1\}$ compatible with the partial action of Thompson's group~$V$, and associate a subgroup~$\Stab{V}{\Part}$ of~$V$. We…

This paper investigates the finite generation of cluster automorphism groups. By applying the pseudo $\mathbb{N}$-grading introduced in our previous work, we establish a sufficient condition for a cluster automorphism group to be finitely…