Related papers: Random graphs of free groups contain surface subgr…
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.
The fine 1-curve graph of a surface is a graph whose vertices are simple closed curves on the surface and whose edges connect vertices that intersect in at most one point. We show that the automorphism group of the fine 1-curve graph is…
Let $G$ be a hyperbolic group that splits as a graph of free groups with cyclic edge groups. We prove that, unless $G$ is isomorphic to a free product of free and surface groups, every finite abelian group $M$ appears as a direct summand in…
A new bound for the rank of the intersection of finitely generated subgroups of a free group is given, formulated in topological terms, and very much in the spirit of Stallings. The bound is a contribution to (although unfortunately not a…
We describe a family of rational affine surfaces S with huge groups of automorphisms in the following sense: the normal subgroup of Aut(S) generated by all its algebraic subgroups is not generated by any countable family of such subgroups,…
The special linear groups, the mapping class groups of surfaces, the outer autormorphism groups of free groups appear in numerous domains. Their analogies, developped in particular in K. Vogtmann's work, have been written about a lot. In…
A beautifully simple free generating set for the commutator subgroup of a free group was constructed by Tomaszewski. We give a new geometric proof of his theorem, and show how to give a similar free generating set for the commutator…
We present a notion of a random toric surface modeled on a notion of a random graph. We then study some threshold phenomena related to the smoothness of the resulting surfaces.
We give a sufficient condition under which the fundamental group of a reglued graph of surfaces is hyperbolic. A reglued graph of surfaces is constructed by cutting a fixed graph of surfaces along the edge surfaces, then regluing by…
We prove that every simplicial automorphism of the free splitting graph of a free group of at least rank 3 is induced by an outer automorphism of the free group.
We prove an estimate for the rank of the intersection of free subgroups in virtually free groups, which is analogous to the Hanna Neumann inequality for subgroups in a free group and to the S.V. Ivanov estimate for subgroups in free…
A cyclic subgroup graph of a group $G$ is a graph whose vertices are cyclic subgroups of $G$ and two distinct vertices $H_1$ and $H_2$ are adjacent if $H_1\leq H_2$, and there is no subgroup $K$ such that $H_1<K<H_2$. M.T\u{a}rn\u{a}uceanu…
We construct embeddings of surface groups into the group of germs of analytic diffeomorphisms in one variable.
In this note, we prove that a random extension of either the free group $F_N$ of rank $N\ge3$ or of the fundamental group of a closed, orientable surface $S_g$ of genus $g\ge2$ is a hyperbolic group. Here, a random extension is one…
We investigate the separability of several well known classes of subgroups of the mapping class group of a surface.
We show that on an arbitrary finitely generated non virtually solvable linear group, any two independent random walks will eventually generate a free subgroup. In fact, this will hold for an exponential number of independent random walks.
A finitely generated group admits a decomposition, called its Grushko decomposition, into a free product of freely indecomposable groups. There is an algorithm to construct the Grushko decomposition of a finite graph of finite rank free…
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
A graph product kernel means the kernel of the natural surjection from a graph product to the corresponding direct product. We prove that a graph product kernel of countable groups is special, and a graph product of finite or cyclic groups…