Related papers: On the Complexity of Identifying Groups without Ab…

The group testing problem consists of determining a small set of defective items from a larger set of items based on tests on groups of items, and is relevant in applications such as medical testing, communication protocols, pattern…

We show that there is a dense set $\ourset\subseteq \mathbb{N}$ of group orders and a constant $c$ such that for every $n\in \ourset$ we can decide in time $O(n^2(\log n)^c)$ whether two $n\times n$ multiplication tables describe isomorphic…

We study a class of finite groups $G$ which behave similarly to elementary abelian $p$-groups with $p$ prime, that is, there exists a subgroup $N$ such that all elements of $G\setminus N$ are conjugate or inverse-conjugate under $\Aut(G)$.…

We present several constraints on the absolute Galois groups G_F of fields F containing a primitive pth root of unity, using restrictions on the cohomology of index p normal subgroups from a previous paper by three of the authors. We first…

We study to what extent group $C^\ast$-algebras are characterized by their unitary groups. A complete characterization of which Abelian group $C^\ast$-algebras have isomorphic unitary groups is obtained. We compare these results with other…

We investigate faithful representations of $\operatorname{Alt}(n)$ as automorphisms of a connected group $G$ of finite Morley rank. We target a lower bound of $n$ on the rank of such a nonsolvable $G$, and our main result achieves this in…

Let $A \leq G$ be a subgroup of a group $G$. An $A$-complement of $G$ is a subgroup $H$ of $G$ such that $G = A H$ and $A \cap H = \{1\}$. The \emph{classifying complements problem} asks for the description and classification of all…

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…

Let $G$ be a group and write $\mbox{Perm}(G)$ for its symmetric group. Define $\mbox{Hol}(G)$ to be the holomorph of $G$, regarded as a subgroup of $\mbox{Perm}(G)$, and let $\mbox{NHol}(G)$ denote its normalizer. The quotient $T(G) =…

Let $G$ be an abelian group and $\mathbb{K}$ an algebraically closed field of characteristic zero. A. Valenti and M. Zaicev described the $G$-gradings on upper block-triangular matrix algebras provided that $G$ is finite. We prove that…

We show that a finitely generated abelian group $G$ of torsion-free rank $n\geq 1$ admits a $n+r$ dimensional model for the classifying space with isotropy in the family of subgroups of torsion-free rank less than or equal to $r\geq 0$.

Skew morphisms, which generalise automorphisms for groups, provide a fundamental tool for the study of regular Cayley maps and, more generally, for finite groups with a complementary factorisation $G=BY$, where $Y$ is cyclic and core-free…

We investigate effective properties of uncountable free abelian groups. We show that identifying free abelian groups and constructing bases for such groups is often computationally hard, depending on the cardinality. For example, we show,…

The densities of small linear structures (such as arithmetic progressions) in subsets of Abelian groups can be expressed as certain analytic averages involving linear forms. Higher-order Fourier analysis examines such averages by…

We study the complexity of graph problems on graphs defined on groups, especially power graphs. We observe that an isomorphism invariant problem, such as Hamiltonian Path, Partition into Cliques, Feedback Vertex Set, Subgraph Isomorphism,…

Let G be a group of permutations of a denumerable set E. The profile of G is the function phi which counts, for each n, the number phi(n) of orbits of G acting on the n-subsets of E. Counting functions arising this way, and their associated…

We investigate the complexity of deciding, given a multiplication table representing a semigroup S, a subset X of S and an element t of S, whether t can be expressed as a product of elements of X. It is well-known that this problem is…

The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…

We study anomalies of non-Abelian discrete symmetries; which part of non-Abelian group is anomaly free and which part can be anomalous. It is found that the anomaly-free elements of the group $G$ generate a normal subgroup $G_0$ of $G$ and…

A classical difficult isomorphism testing problem is to test isomorphism of p-groups of class 2 and exponent p in time polynomial in the group order. It is known that this problem can be reduced to solving the alternating matrix space…