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

Evidences have suggested that counting representations are sometimes tractable even when the corresponding classification problem is almost impossible, or "wild" in a precise sense. Such counting problems are directly related to matrix…

Extending earlier work of Guralnick and of Cai and Zhang, we classify the almost simple groups which have transitive permutation representations of prime power degree $p^k$, and those which have $p$-complements (stabilisers of order coprime…

Isomorphisms p between pattern classes A and B are considered. It is shown that, if p is not a symmetry of the entire set of permutations, then, to within symmetry, A is a subset of one a small set of pattern classes whose structure,…

We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…

Isomorphism is central to the structure of mathematics and has been formalized in various ways within dependent type theory. All previous treatments have done this by replacing quantification over sets with quantification over groupoids of…

In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…

Using the computational algebra system GAP (http://www.gap-system.org) and the GAP package LAGUNA (http://www.cs.st-andrews.ac.uk/~alexk/laguna.htm), we checked that all 2-groups of order not greater than 32 are determined by normalized…

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…

In a reconfiguration problem, we are given two feasible solutions of a combinatorial problem and our goal is to determine whether it is possible to reconfigure one into the other, with the steps dictated by specific reconfiguration rules.…

A skew morphism of a finite group $B$ is a permutation of $B$ fixing the identity and satisfying $\varphi(xy) = \varphi(x)\varphi^{i_x}(y)$ for some integers $i_x$ indexed by $x \in B$. The enumeration of skew morphisms of finite cyclic…

Let p be a prime number and let c, d be natural numbers. Then, the number of possible isomorphism types for the mod p cohomology algebra of a d-generated finite p-group of nilpotency class c is bounded by a function depending only on p, c…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

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…

We propose and study a variation of the classical isomorphism problem for group rings in the context of projective representations. We formulate several weaker conditions following from our notion and give all logical connections between…

The classification of maximal function fields over a finite field is a difficult open problem, and even determining isomorphism classes among known function fields is challenging in general. We study a particular family of maximal function…

Since the introduction of the concept of isotopism of algebras by Albert in 1942, a prolific literature on the subject has been developed for distinct types of algebras. Nevertheless, there barely exists any result on the problem of…

The results of computer computations determining the automorphism groups of the groups of order 32$p$ for $p \geq 3$ are given in several tables. Presentations for the automorphism groups of the groups of order 32, which in many cases…

For each prime p, we exhibit pairs of p-groups all of whose integral cohomology groups are isomorphic. The method used involves very little calculation. The groups are exhibited as kernels of homomorphisms from a compact Lie group G to…

Recently, we have endowed various categories of groups with topologies. The purpose of this paper is to introduce on these categories others topologies which are statistically more suitable to study well-known problems in groups theory. We…

For the first time we represent every finite group in the form of a graph in this book. The authors choose to call these graphs as identity graph, since the main role in obtaining the graph is played by the identity element of the group.…