English
Related papers

Related papers: Verbally closed virtually free subgroups

200 papers

It is well known that the set of values of a lower central word in a group $G$ need not be a subgroup. For a fixed lower central word $\gamma_r$ and for $p\ge 5$, Guralnick showed that if $G$ is a finite $p$-group such that the verbal…

Group Theory · Mathematics 2019-07-29 Iker de las Heras , Marta Morigi

We discuss in the context of finite extensions two classical theorems of Takahasi and Howson on subgroups of free groups. We provide bounds for the rank of the intersection of subgroups within classes of groups such as virtually free…

Group Theory · Mathematics 2014-12-11 Vitor Araujo , Pedro V. Silva , Mihalis Sykiotis

In this paper we investigate Gromov's question: whether every one-ended word hyperbolic group contains a surface subgroup. The case of double groups is considered by studying the associated one relator groups. We show that the majority…

Group Theory · Mathematics 2013-02-19 Anastasia V. Kisil

Finitely generated (non-abelian) free metabelian pro-p groups, and wreath products of f.g. free abelian pro-p groups, are all finitely axiomatizable in the class of all profinite groups.

Group Theory · Mathematics 2023-03-28 Dan Segal

An elementary proof is given for the fact that every locally compact subsemigroup of a compact topological group is a closed subgroup. A sample consequence is that every commutative cancellative pseudocompact locally compact Hausdorff…

General Topology · Mathematics 2020-10-13 Julio César Hernández Arzusa

We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…

Group Theory · Mathematics 2018-11-08 Rita Gitik

The notions of stable and Morse subgroups of finitely generated groups generalize the concept of a quasiconvex subgroup of a word-hyperbolic group. For a word-hyperbolic group $G$, Kapovich provided a partial algorithm which, on input a…

Group Theory · Mathematics 2020-04-21 Heejoung Kim

We provide an algorithm to solve the word problem in all fundamental groups of closed 3-manifolds; in particular, we show that these groups are autostackable. This provides a common framework for a solution to the word problem in any closed…

Group Theory · Mathematics 2017-12-14 Mark Brittenham , Susan Hermiller , Tim Susse

We note a parallel between some ideas of stable model theory and certain topics in finite combinatorics related to the sum-product phenomenon. For a simple linear group G, we show that a finite subset X with |X X \^{-1} X |/ |X| bounded is…

Logic · Mathematics 2011-05-17 Ehud Hrushovski

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

Group Theory · Mathematics 2015-07-07 Emmanuel Jeandel

We give a technical result that implies a straightforward necessary and sufficient conditions for a graph of groups with virtually cyclic edge groups to be one ended. For arbitrary graphs of groups, we show that if their fundamental group…

Group Theory · Mathematics 2016-01-20 Nicholas Touikan

A classical result of Schreier states that nontrivial finitely generated normal subgroups of free groups are of finite index, that is, free groups can only quotient to finite groups with finitely generated kernel. In this note we extend…

Group Theory · Mathematics 2022-07-05 Montserrat Casals-Ruiz , Jone Lopez de Gamiz Zearra

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…

Group Theory · Mathematics 2013-08-15 A. Yu. Olshanskii

We present the results of computer experiments suggesting that the probability that a random multiword in a free group is virtually geometric decays to zero exponentially quickly in the length of the multiword. We then prove this fact.

Group Theory · Mathematics 2019-02-20 Christopher H. Cashen , Jason F. Manning

A group G is called subgroup conjugacy separable (abbreviated as SCS), if any two finitely generated and non-conjugate subgroups of G remain non-conjugate in some finite quotient of G. We prove that the free groups and the fundamental…

Group Theory · Mathematics 2010-12-24 Oleg Bogopolski , Fritz Grunewald

A free semigroup algebra S is the weak-operator-closed (non-self-adjoint) operator algebra generated by n isometries with pairwise orthogonal ranges. A unit vector x is said to be wandering for S if the set of images of x under…

Operator Algebras · Mathematics 2015-09-15 Matthew Kennedy

We characterize group compactifications of discrete groups for which there exists an equivariant retraction onto the boundary. In particular, we prove an equivariant analogue of Brouwer's No-Retraction theorem for large classes of group…

Group Theory · Mathematics 2025-09-15 Yair Hartman , Aranka Hrušková , Mehrdad Kalantar , Tomer Zimhoni

We show that given a finitely generated LERF group $G$ with positive rank gradient, and finitely generated subgroups $A,B \leq G$ of infinite index, one can find a finite index subgroup $B_0$ of $B$ such that $[G : \langle A \cup B_0…

Group Theory · Mathematics 2016-02-02 Mark Shusterman

We show that, for any (symmetric) finite generating set of the Torelli group of a closed surface, the probability that a random word is not pseudo-Anosov decays exponentially in terms of the length of the word.

Geometric Topology · Mathematics 2011-04-06 Justin Malestein , Juan Souto

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…

Group Theory · Mathematics 2013-11-05 Alexander Zakharov
‹ Prev 1 8 9 10 Next ›