Related papers: Computational Complexity of Finding Subgroups of a…

Let $\{G_i :i\in\N\}$ be a family of finite Abelian groups. We say that a subgroup $G\leq \prod\limits_{i\in \N}G_i$ is \emph{order controllable} if for every $i\in \mathbb{N}$ there is $n_i\in \mathbb{N}$ such that for each $c\in G$, there…

We obtain a classification of the finite two-generated cyclic-by-abelian groups of prime-power order. For that we associate to each such group $G$ a list $\inv(G)$ of numerical group invariants which determines the isomorphism type of $G$.…

Let $G$ be a finite group given as input by its multiplication table. For a subset $S$ of $G$ and an element $g\in G$ the Cayley Group Membership Problem (denoted CGM) is to check if $g$ belongs to the subgroup generated by $S$. While this…

Let $p$ be a prime number and suppose that every maximal subgroup of a finite group is either $p$-nilpotent or has prime index. Such group need not be $p$-solvable, and we study its structure by proving that only one nonabelian simple group…

The abelian Hidden Subgroup Problem (HSP) is extremely general, and many problems with known quantum exponential speed-up (such as integers factorisation, the discrete logarithm and Simon's problem) can be seen as specific instances of it.…

We are concerned with the Hidden Subgroup Problem for finite groups. We present a simplified analysis of a quantum algorithm proposed by Hallgren, Russell and Ta-Shma as well as a detailed proof of a lower bound on the probability of…

Many open conjectures in the representation theory of finite groups can be studied by reducing them to related questions about quasi-simple groups. In such studies, $p$-radical subgroups typically play a critical role. To classify the…

We classify abelian subgroups of the automorphism group of any compact simple Lie algebra whose centralizer has the same dimension as the dimension of the subgroup. This leads to a classification of the maximal abelian subgroups of compact…

Based on the general strategy described by Borel and Serre and the Voronoi algorithm for computing unit groups of orders we present an algorithm for finding presentations of $S$-unit groups of orders. The algorithm is then used for some…

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…

We give an exposition of the hidden subgroup problem for dihedral groups from the point of view of the standard hidden subgroup quantum algorithm for finite groups. In particular, we recall the obstructions for strong Fourier sampling to…

This paper investigates the critical group of a faithful representation of a finite group. It computes the order of the critical group in terms of the character values, and gives some restrictions on its subgroup structure. It also computes…

Let $G$ be a nonabelian group. We say that $G$ has an abelian partition, if there exists a partition of $G$ into commuting subsets $A_1, A_2, \ldots, A_n$ of $G$, such that $|A_i|\geqslant 2$ for each $i=1, 2, \ldots, n$. This paper…

We consider abelain subgroups of small index in finite groups. More generally, we consider subgroups such that the product of their index by the index of their centralizer is small.

Recently, several works by a number of authors have provided characterizations of integral undirected Cayley graphs over generalized dihedral groups and generalized dicyclic groups. We generalize and unify these results in two different…

One of the classical problems in group theory is determining the set of positive integers $n$ such that every group of order $n$ has a particular property $P$, such as cyclic or abelian. We first present the Sylow theorems and the idea of…

An algorithm is presented allowing the construction of fast Fourier transforms for any solvable group on a classical computer. The special structure of the recursion formula being the core of this algorithm makes it a good starting point to…

Generalising a previous result, we determine all non-abelian finite simple groups whose order has largest prime divisor not exceeding $10^4$. The computer code for this and similar calculations is made available.

The purpose of this paper is to determine the number of fuzzy subgroups of a finite abelian group of order $p^{n}q^{m}$. As an application of our main result, explicit formulas for the number of fuzzy subgroups of…

We construct a polynomial-time algorithm which given a graph $\Gamma$ finds the full set of non-equivalent Cayley representations of $\Gamma$ over the group $D\cong C_p\times C_{p^k}$, where $p\in\{2,3\}$ and $k\geq 1$. This result implies…