相关论文: Computing generators of the unit group of an integ…

We provide an algorithm to compute generators of the orthogonal group of the discriminant group associated to an integral quadratic lattice over the integers. We give a closed formula for its order.

Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…

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$.…

An $integral$ of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. This paper continues the investigation on integrals of groups started in the work arXiv:1803.10179. We study: (1) A sufficient condition for a bound…

For the rational group algebra $\mathbb{Q}G$ of a finite group $G$, we provide an effective method to compute a complete set of matrix units and, in particular, primitive orthogonal idempotents in a simple component of $\mathbb{Q}G$, which…

In this note, we give the explicit formula for the number of multisubsets of a finite abelian group $G$ with any given size such that the sum is equal to a given element $g\in G$. This also gives the number of partitions of $g$ into a given…

We describe an algorithm for computing Schur indices of irreducible characters of a finite group $G$, based on computations within $G$ and its subgroups and with their character tables. The algorithm has been implemented within \Magma\ and…

We compute explicitly the group of connected components $\pi_0G(\mathbb{R})$ of the real Lie group $G(\mathbb{R})$ for an arbitrary (not necessarily linear) connected algebraic group $G$ defined over the field $\mathbb{R}$ of real numbers.…

We give an explicit description for a basis of a subgroup of finite index in the group of central units of the integral group ring $\Z G$ of a finite abelian-by-supersolvable group such that every cyclic subgroup of order not a divisor of 4…

In this paper, we study the question of when the symmetric units in an integral group ring ZG form a multiplicative group. When G is periodic, necessary and sufficient conditions are given for this to occur.

We describe the computation of class groups and unit groups of number fields as implemented in Magma (V2.29). After quickly reviewing the main algorithms based on factor bases, relation collection, and analytic class number evaluation, we…

Degree bounds for algebra generators of invariant rings are a topic of longstanding interest in invariant theory. We study the analogous question for field generators for the field of rational invariants of a representation of a finite…

For each family of finite classical groups, and their associated simple quotients, we provide an explicit presentation on a specific generating set of size at most 8. Since there exist efficient algorithms to construct this generating set…

We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP

Consider any sequence of finite groups $A^t$, where $t$ takes values in an integer index set $\mathbf{Z}$. A group system $A$ is a set of sequences with components in $A^t$ that forms a group under componentwise addition in $A^t$, for each…

The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…

We propose an algorithm which for any recursive group $G$, given by its effectively enumerable generators and recursively enumerable relations, outputs an explicit embedding of $G$ into a finitely presented group directly written by its…

We generalize the Plesken-Fabia\'nska $\mathrm{L}_2$-quotient algorithm for finitely presented groups on two or three generators to allow an arbitrary number of generators. The main difficulty lies in a constructive description of the…

It is shown that for any torsion unit of augmentation one in the integral group ring $\mathbb{Z} G$ of a finite solvable group $G$, there is an element of $G$ of the same order.