English
Related papers

Related papers: On the profinite rigidity of triangle groups

200 papers

We give new and improved results on the freeness of subgroups of free profinite groups: A subgroup containing the normal closure of a finite word in the elements of a basis is free; Every infinite index subgroup of a finitely generated…

Group Theory · Mathematics 2017-05-17 Mark Shusterman

We call a semigroup $S$ f-noetherian if every right congruence of finite index on $S$ is finitely generated. We prove that every finitely generated semigroup is f-noetherian, and investigate whether the properties of being f-noetherian and…

Group Theory · Mathematics 2020-02-13 Craig Miller

We classify birationally rigid orbifold Fano 3-folds of index one defined by $5 \times 5$ Pfaffians. We give a sharp criterion for birational rigidity of these families based on the type of singularities that the varieties admit. Various…

Algebraic Geometry · Mathematics 2022-07-22 Hamid Abban , Takuzo Okada

A group $G$ is twisted conjugacy separable if for every automorphism $\varphi$, distinct $\varphi$-twisted conjugacy classes can be separated in a finite quotient. Likewise, $G$ is completely twisted conjugacy separable if for any group $H$…

Group Theory · Mathematics 2026-03-04 Sam Tertooy

We characterize finite groups G generated by orthogonal transformations in a finite-dimensional Euclidean space V whose fixed point subspace has codimension one or two in terms of the corresponding quotient space V/G with its quotient…

Geometric Topology · Mathematics 2017-11-02 Christian Lange

A group $G$ is said to be a $C$-group if every subgroup $H$ has a permutable complement, i.e. if there exists a subgroup $K$ of $G$ such that $G=HK$ and $H \cap K=1$. In this paper, we study the profinite counterpart of this concept. We say…

Group Theory · Mathematics 2025-07-29 Gustavo A. Fernández-Alcober , Giulia Sabatino

A group-word $w$ is called concise if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G$. It is known that there are words that are not concise. The problem whether every word is concise in the…

Group Theory · Mathematics 2024-02-26 Pavel Shumyatsky

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

Group Theory · Mathematics 2021-02-23 Yanis Amirou

In this paper we prove that the profinite completion $\mathcal{\hat G}$ of the Grigorchuk group $\mathcal{G}$ is not finitely presented as a profinite group. We obtain this result by showing that $H^2(\mathcal{\hat G},\field{F}_2)$ is…

Group Theory · Mathematics 2012-06-13 Mustafa Gokhan Benli

A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…

Group Theory · Mathematics 2025-04-04 Christopher A. Schroeder , Hung P. Tong-Viet

In this paper, we investigate finite solvable tidy groups. We classify the tidy $\{ p, q \}$-groups. Combining this with a previous result, we are able to characterize the finite tidy solvable groups. Using this characterization, we bound…

We prove that every countable family of countable acylindrically hyperbolic groups has a common finitely generated acylindrically hyperbolic quotient. As an application, we obtain an acylindrically hyperbolic group $Q$ with strong fixed…

Group Theory · Mathematics 2019-07-09 A. Minasyan , D. Osin

We undertake the study of profinite quandles. We provide several constructions of profinite quandles from profinite groups, and from other profinite quandle. We characterize which subquandles of profinite quandles are again profinite.…

Geometric Topology · Mathematics 2024-11-05 Alexander W. Byard , Brian Cai , Nathan P. Jones , Lucy H. Vuong , David N. Yetter

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

Group Theory · Mathematics 2010-12-09 A. Myasnikov , D. Osin

We use the theory of group actions on profinite trees to prove that the fundamental group of a finite, 1-acylindrical graph of free groups with finitely generated edge groups is conjugacy separable. This has several applications: we prove…

Group Theory · Mathematics 2009-06-02 Owen Cotton-Barratt , Henry Wilton

We determine when an arithmetic subgroup of a reductive group defined over a global function field is of type FP_\infty by comparing its large-scale geometry to the large-scale geometry of lattices in real semisimple Lie groups.

Group Theory · Mathematics 2007-05-23 Kai-Uwe Bux , Kevin Wortman

By arithmeticity and superrigidity, a commensurability class of lattices in a higher rank Lie group is defined by a unique algebraic group over a unique number subfield of $\mathbb{R}$ or $\mathbb{C}$. We prove an adelic version of…

Group Theory · Mathematics 2021-09-22 Holger Kammeyer , Steffen Kionke

Residual finiteness growth measures how well-approximated a group is by its finite quotients. We prove that some related growth functions characterize linearity for a class of groups including all hyperbolic groups.

Group Theory · Mathematics 2016-11-16 Khalid Bou-Rabee , D. B. McReynolds

We investigate whether a finitely generated profinite group G could have a finitely generated infinite image. A result of Dan Segal shows that this is impossible if G is prosoluble. We prove that such an image does not exist if G is…

Group Theory · Mathematics 2011-07-12 Nikolay Nikolov

We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…

Group Theory · Mathematics 2015-10-27 Anton A. Klyachko , Ayrana K. Mongush