English
Related papers

Related papers: On the isomorphism problem for certain $p$-groups

200 papers

Let $G$ be a group. An automorphism of $G$ is called intense if it sends each subgroup of $G$ to a conjugate; the collection of such automorphisms is denoted by $\mathrm{Int}(G)$. In the special case in which $p$ is a prime number and $G$…

Group Theory · Mathematics 2023-09-25 Mima Stanojkovski

For a finite group G of Lie type and a prime p, we compare the automorphism groups of the fusion and linking systems of G at p with the automorphism group of G itself. When p is the defining characteristic of G, they are all isomorphic,…

Group Theory · Mathematics 2016-01-19 Carles Broto , Jesper M. Møller , Bob Oliver

The well-known Landau's theorem states that, for any positive integer $k$, there are finitely many isomorphism classes of finite groups with exactly $k$ (conjugacy) classes. We study variations of this theorem for $p$-regular classes as…

Group Theory · Mathematics 2015-03-27 Alexander Moreto , Hung Ngoc Nguyen

The twisted group ring isomorphism problem (TGRIP) is a variation of the classical group ring isomorphism problem. It asks whether the ring structure of the twisted group ring determines the group up to isomorphism. In this article, we…

Group Theory · Mathematics 2024-08-08 Sumana Hatui , Gurleen Kaur , Sahanawaj Sabnam

We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our…

Group Theory · Mathematics 2018-02-21 Géraud Sénizergues , Armin Weiß

A finite group R is a CI-group if, whenever S and T are subsets of R with the Cayley graphs Cay(R,S) and Cay(R,T) isomorphic, there exists an automorphism x of R with S^x=T. The classification of CI-groups is an open problem in the theory…

Combinatorics · Mathematics 2014-02-20 Edward Dobson , Joy Morris , Pablo Spiga

The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…

Rings and Algebras · Mathematics 2007-05-23 Timo Hanke

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G cong H. For several decades, the n^(log_p n + O(1)) generator-enumeration bound (where p is the smallest prime…

Data Structures and Algorithms · Computer Science 2013-12-09 David J. Rosenbaum , Fabian Wagner

Let $p$ be a prime and let $G$ be a finite $p$-group. We show that the isomorphism type of the maximal abelian direct factor of $G$, as well as the isomorphism type of the group algebra over $\mathbb F_p$ of the non-abelian remaining direct…

Group Theory · Mathematics 2022-11-16 Diego García-Lucas

We consider pairs of finitely presented, residually finite groups $u:P\hookrightarrow \Gamma$. We prove that there is no algorithm that, given an arbitrary such pair, can determine whether or not the associated map of profinite completions…

Group Theory · Mathematics 2014-01-14 Martin R. Bridson , Henry Wilton

In 1934, Garrett Birkhoff has shown that the number of isomorphism classes of finite metabelian groups of order $p^{22}$ tends to infinity with $p$. More precisely, for each prime number $p$ there is a family…

Group Theory · Mathematics 2014-09-22 Markus Schmidmeier

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

Group Theory · Mathematics 2007-05-23 Inna Bumagin , Olga Kharlampovich , Alexei Miasnikov

The Profinite Isomorphism Problem for a class of groups \mathcal{C} asks for an algorithm that decides for any two groups in \mathcal{C} whether they have isomorphic profinite completions. We present the positive solution to this problem…

Group Theory · Mathematics 2026-05-29 Dan Segal

We find an upper bound for the number of groups of order $n$ up to isomorphism in the variety $G = A_pA_qA_r$, where $p$, $q$ and $r$ are distinct primes. We also find a bound on the orders and on the number of conjugacy classes of…

Group Theory · Mathematics 2024-09-16 Arushi , Geetha Venkataraman

In recent work, Rosenbaum and Wagner showed that isomorphism of explicitly listed $p$-groups of order $n$ could be tested in $n^{\frac{1}{2}\log_p n + O(p)}$ time, roughly a square root of the classical bound. The $O(p)$ term is entirely…

Computational Complexity · Computer Science 2015-11-03 Eugene M. Luks

For every prime $p$, we construct an infinite countable group that contains precisely $p-1$ elements which are not $p$th powers.

Group Theory · Mathematics 2017-04-06 S. V. Ivanov

The strong isomorphism classes of extensions of finite groups are parametrized by orbits of a prescribed action on the second cohomology group. We study these orbits in the case of extensions of a finite abelian $p$-group by a cyclic factor…

Group Theory · Mathematics 2023-09-25 Oihana Garaialde Ocaña , Mima Stanojkovski

We investigate which invariants of groups are powerful in distinguishing non-isomorphic p-groups. We introduce the notations of siblings and twins for p-groups that are difficult to distinguish and we describe the siblings and twins among…

Group Theory · Mathematics 2026-03-11 Bettina Eick , Henrik Schanze

Let $G$ be a finite group having a factorisation $G=AB$ into subgroups $A$ and $B$ with $B$ cyclic and $A\cap B=1,$ and let $b$ be a generator of $B$. The associated skew-morphism is the bijective mapping $f:A \to A$ well defined by the…

Group Theory · Mathematics 2015-11-24 István Kovács , Roman Nedela

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