Related papers: Arithm\'etique des Groupes Ab\'eliens Finis

Given a number field $k$, we show that, for many finite groups $G$, all the Galois extensions of $k$ with Galois group $G$ cannot be obtained by specializing any given finitely many Galois extensions $E/k(T)$ with Galois group $G$ and $E/k$…

We present an algorithm that decides whether a finitely generated linear group over an infinite field is solvable-by-finite: a computationally effective version of the Tits alternative. We also give algorithms to decide whether the group is…

We prove a strong general-purpose bound for the diameter of a finite group depending only on the diameters of its composition factors and the maximal exponent of a normal abelian section. There are a number of notable applications: (1) if…

We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…

Let G_1 and G_2 be two groups. If a group homomorphism \varphi : G_1 \longrightarrow G_2 maps a \in G_1 into b \in G_2 such that \varphi(a) = b, then we say a degenerates to b and if every element of G_1 degenerates to elements in G_2, then…

Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational…

In this article, we prove that every finite abelian group $G$ of odd order occurs as a subgroup of the class group of infinitely many real cyclotomic fields.

The concept of a C-approximable group, for a class of finite groups C, is a common generalization of the concepts of a sofic, weakly sofic, and linear sofic group. Glebsky raised the question whether all groups are approximable by finite…

Counting number fields with prescribed Galois group is an enduring challenge in arithmetic statistics. Using the determinant method, we provide an upper bound for even groups, which is new in some cases.

We prove that every finite abelian group G occurs as a subgroup of the class group of infinitely many real cyclotomic fields.

An algorithm for the explicit computation of a complete set of primitive central idempotents, Wedderburn decomposition and the automorphism group of the semisimple group algebra of a finite metabelian group is developed. The algorithm is…

We obtain strong information on the asymptotic behaviour of the counting function for nilpotent Galois extensions with bounded discriminant of arbitrary number fields. This extends previous investigations for the case of abelian groups. In…

In this note we provide some counterexamples for the conjecture of Moret\'{o} on finite simple groups, which says that any finite simple group $G$ can determined in terms of its order $|G|$ and the number of elements of order $p$, where $p$…

Let $G$ be a finite $p$-group whose derived subgroup $G'$ can be generated by $2$ elements. If $G'$ is abelian, Guralnick proved that every element of $G'$ is a commutator. In this paper, we prove that the condition that $G'$ should be…

In an abelian group G, a more sums than differences (MSTD) set is a subset A of G such that |A+A|>|A-A|. We provide asymptotics for the number of MSTD sets in finite abelian groups, extending previous results of Nathanson. The proof…

In this article we study the Galois group of field generated by division points of special class of formal group laws and prove an equivalent condition for the group to be abelian. Further, we explore relations between the endomorphism ring…

A matching in a group G is a bijection f from a subset A to a subset B in G such that af(a) does not belong to A for all a in A. The group G is said to have the matching property if, for any finite subsets A,B in G of same cardinality with…

Elder, Kambites, and Ostheimer showed that if the word problem of a finitely generated group $H$ is accepted by a $G$-automaton for an abelian group $G$, then $H$ is virtually abelian. We give a new, elementary, and purely combinatorial…

This is a collection of examples showing how the GAP system can be used to compute information about the probabilistic generation of finite almost simple groups. It includes all examples that were needed for the computational results in the…

Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…