arXiv subjects

Aglaia Myropolska

Publications and source records attributed to Aglaia Myropolska.

6 recordsLinked to original sources

arXiv2017

Expected Depth of Random Walks on Groups

For $G$ a finitely generated group and $g \in G$, we say $g$ is detected by a normal subgroup $N \lhd G$ if $g \notin N$. The depth $D_G(g)$ of $g$ is the lowest index of a normal, finite index subgroup $N$ that detects $g$. In this paper we study the expected depth, $\mathbb E[D_G(X_n)]$, where $X_n$ is a random walk on $G$. We give several criteria that imply that $$\mathbb E[D_G(X_n)] \xrightarrow[n\to \infty]{} 2 + \sum_{k \geq 2}\frac{1}{[G:Λ_k]}\, ,$$ where $Λ_k$ is the intersection of all normal subgroups of index at most $k$. In particular, the equality holds in the class of all nilpotent groups and in the class of all linear groups satisfying Kazhdan Property $(T)$. We explain how the right-hand side above appears as a natural limit and also give an example where the convergence does not hold.

math.GR↗

arXiv2015

Groups with near exponential residual finiteness growth

A function $\mathbb{N} \to \mathbb{N}$ is near exponential if it is bounded above and below by functions of the form $2^{n^c}$ for some $c > 0$. In this article we develop tools to recognize the near exponential residual finiteness growth in groups acting on rooted trees. In particular, we show the near exponential residual finiteness growth for certain branch groups, including the first Grigorchuk group, the family of Gupta-Sidki groups and their variations, and Fabrykowski-Gupta groups. We also show that the family of Gupta-Sidki p-groups, for $p\geq 5$, have super-exponential residual finiteness growths.

math.GR↗

arXiv2015

The class $\mathcal{MN}$ of groups in which all maximal subgroups are normal

We investigate the class $\mathcal{MN}$ of groups with the property that all maximal subgroups are normal. The class $\mathcal{MN}$ appeared in the framework of the study of potential counter-examples to the Andrews-Curtis conjecture. In this note we give various structural properties of groups in $\mathcal{MN}$ and present examples of groups in $\mathcal{MN}$ and not in $\mathcal{MN}$.

math.GR↗

arXiv2014

Nielsen equivalence in Gupta-Sidki groups

For a group $G$ generated by $k$ elements, the Nielsen equivalence classes are defined as orbits of the action of $\operatorname{Aut} F_k$, the automorphism group of the free group of rank $k$, on the set of generating $k$-tuples of $G$. Let $p\geq 3$ be prime and $G_p$ the Gupta-Sidki $p$-group. We prove that there are infinitely many Nielsen equivalence classes on generating pairs of $G_p$.

math.GR↗

arXiv2014

Andrews-Curtis and Nielsen equivalence relations on some infinite groups

The Andrews-Curtis conjecture asserts that, for a free group $F_n$ of rank $n$ and a free basis $(x_1,...,x_n)$, any normally generating tuple $(y_1,...,y_n)$ is Andrews-Curtis equivalent to $(x_1,...,x_n)$. This equivalence corresponds to the actions of $\operatorname{Aut}F_n$ and of $F_n$ on normally generating $n$-tuples. The equivalence corresponding to the action of $\operatorname{Aut}F_n$ on generating $n$-tuples is called Nielsen equivalence. The conjecture for arbitrary finitely generated group has its own importance to analyse potential counter-examples to the original conjecture. We study the Andrews-Curtis and Nielsen equivalence in the class of finitely generated groups for which every maximal subgroup is normal, including nilpotent groups and Grigorchuk groups.

math.GR↗

arXiv2014

On transitivity and (non)amenability of Aut(F_n) actions on group presentations

For a finitely generated group $G$ the Nielsen graph $N_n(G)$, $n\geq \operatorname{rank}(G)$, describes the action of the group $\operatorname{Aut}F_n$ of automorphisms of the free group $F_n$ on generating $n$-tuples of G by elementary Nielsen moves. The question of (non)amenability of Nielsen graphs is of particular interest in relation with the open question about Property $(T)$ for $\operatorname{Aut}F_n$, $n\geq 4$. We prove nonamenability of Nielsen graphs $N_n(G)$ for all $n\ge \max\{2,\operatorname{rank}(G)\}$ when $G$ is indicable, and for $n$ big enough when $G$ is elementary amenable. We give an explicit description of $N_d(G)$ for relatively free (in some variety) groups of rank $d$ and discuss their connectedness and nonamenability. Examples considered include free polynilpotent groups and free Burnside groups.

math.GR↗