English
Related papers

Related papers: Polycyclic groups and profinite isomorphism

200 papers

The set of all closed subgroups of a profinite carries a natural profinite topology. This space of subgroups can be classified up to homeomorphism in many cases, and tight bounds placed on its complexity as expressed by its scattered…

Group Theory · Mathematics 2008-09-30 Paul Gartside , Michael Smith

We study the Modular Isomorphism Problem applying a combination of existing and new techniques. We make use of the small group algebra to give a positive answer for two classes of groups of nilpotency class 3. We also introduce a new…

Rings and Algebras · Mathematics 2023-09-25 L. Margolis , M. Stanojkovski

We fix a finitely presented group $Q$ and consider short exact sequences $1\to N\to G\to Q\to 1$ with $G$ finitely generated. The inclusion $N\to G$ induces a morphism of profinite completions $\hat N\to \hat G$. We prove that this is an…

Group Theory · Mathematics 2014-02-26 Martin R Bridson

The word problem is an old and central problem in (computational) group theory. It is well-known that the word problem is undecidable in general, but decidable for specific types of presentations. Consistent polycyclic presentations are an…

Group Theory · Mathematics 2022-07-14 Tobias Moede , Matthias Neumann-Brosig

The Modular Isomorphism Problem asks if an isomorphism of group algebras of two finite p-groups G and H over a field of characteristic p, implies an isomorhism of the groups G and H. We survey the history of the problem, explain strategies…

Rings and Algebras · Mathematics 2022-04-11 Leo Margolis

Hyperelliptic mapping class groups are defined either as the centralizers of hyperelliptic involutions inside mapping class groups of oriented surfaces of finite type or as the inverse images of these centralizers by the natural…

Geometric Topology · Mathematics 2024-02-12 Marco Boggi

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an…

Geometric Topology · Mathematics 2015-05-27 Martin R. Bridson , Lawrence Reeves

We give a description of finitely generated prosoluble subgroups of the profinite completion of $3$-manifold groups and virtually compact special groups.

Geometric Topology · Mathematics 2025-12-22 Lucas C. Lopes , Pavel A. Zalesskii

Let $G$ be a finite group, $L_1(G)$ be its poset of cyclic subgroups and consider the quantity $\alpha(G)=\frac{|L_1(G)|}{|G|}$. The aim of this paper is to study the class $\cal{C}$ of finite nilpotent groups having…

Group Theory · Mathematics 2018-05-02 Marius Tărnăuceanu , Mihai-Silviu Lazorec

The article deals with profinite groups in which the centralizers are abelian (CA-groups), that is, with profinite commutativity-transitive groups. It is shown that such groups are virtually pronilpotent. More precisely, let G be a…

Group Theory · Mathematics 2018-07-09 Pavel Shumyatsky , Pavel Zalesskii , Theo Zapata

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

Group Theory · Mathematics 2007-05-23 J. -C. Birget , A. Yu. Olshanskii , E. Rips , M. Sapir

In this paper we investigate some properties of the Burnside ring of a profinite group as defined in \cite{ds}. We introduce the notion of the crossed Burnside ring of a profinite FC-group, and generalise some results from finite to…

Group Theory · Mathematics 2022-12-23 Nadia Mazza

Let $G$ be a residually finite, good group of finite virtual cohomological dimension. We prove that the natural monomorphism $G\hookrightarrow\hat{G}$ induces a bijective correspondence between conjugacy classes of finite $p$-subgroups of…

Group Theory · Mathematics 2024-10-29 Marco Boggi , Pavel Zalesskii

We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…

Rings and Algebras · Mathematics 2013-12-02 Mark Kambites , Alexandr Kazda

A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.

Combinatorics · Mathematics 2007-05-23 Aleksandr Golubchik

The aim of this paper is to study the group of isomorphism classes of torsors of finite flat group schemes of rank 2 over a commutative ring $R$. This, in particular, generalises the group of quadratic algebras (free or projective), which…

Algebraic Geometry · Mathematics 2019-02-20 Ilia Pirashvili

We prove that if $G$ is finite 2-generated $p$-group of nilpotence class at most 2 then the group algebra of $G$ with coefficients in the field with $p$ elements determines $G$ up to isomorphisms.

Group Theory · Mathematics 2020-04-07 Osnel Broche , Ángel del Río

We prove that the sign of the Euler characteristic of arithmetic groups with CSP is determined by the profinite completion. In contrast, we construct examples showing that this is not true for the Euler characteristic itself and that the…

Group Theory · Mathematics 2019-01-23 Holger Kammeyer , Steffen Kionke , Jean Raimbault , Roman Sauer

There are many results showing the connection and phenomenon between some low-dimensional manifolds with the profinite completions of their fundamental groups. We focus on some Seifert 4-manifolds about the extent of their profinite…

Geometric Topology · Mathematics 2023-04-05 Jiming Ma , Zixi Wang

The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…

Group Theory · Mathematics 2013-07-24 Hao Liang
‹ Prev 1 3 4 5 6 7 10 Next ›