Related papers: Computing the unit group of a commutative finite $…

For a finite $\mathbb{Z}$-algebra $R$, i.e., for a ring which is not necessarily associative or unitary, but whose additive group is finitely generated, we construct a decomposition of $R/{\rm Ann}(R)$ into directly indecomposable factors…

For a finite $\mathbb{Z}$-algebra $R$, i.e., for a $\mathbb{Z}$-algebra which is a finitely generated $\mathbb{Z}$-module, we assume that $R$ is explicitly given by a system of $\mathbb{Z}$-module generators $G$, its relation module ${\rm…

We give an explicit and character-free construction of a complete set of orthogonal primitive idempotents of a rational group algebra of a finite nilpotent group and a full description of the Wedderburn decomposition of such algebras. An…

We present a method to explicitly compute a complete set of orthogonal primitive idempotents in a simple component with Schur index 1 of a rational group algebra $\mathbb{Q}G$ for $G$ a finite generalized strongly monomial group. For the…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

For a commutative ring R we investigate the property that the sets of minimal primes of finitely generated ideals of R is always finite. We prove this property passes to polynomial ring extensions (in an arbitrary number of variables) over…

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…

We compute the rank of the group of central units in the integral group ring $\Z G$ of a finite strongly monomial group $G$. The formula obtained is in terms of the strong Shoda pairs of $G$. Next we construct a virtual basis of the group…

We consider the computational problem of determining the unit group of a finite ring, by which we mean the computation of a finite presentation together with an algorithm to express units as words in the generators. We show that the problem…

Let $F$ be a field and let $E$ be an \'etale algebra over $F$, that is, a finite product of finite separable field extensions $E = F_1 \times \dots \times F_r$. The classical primitive element theorem asserts that if $r = 1$, then $E$ is…

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

The unipotent groups are an important class of algebraic groups. We show that techniques used to compute with finitely generated nilpotent groups carry over to unipotent groups. We concentrate particularly on the maximal unipotent subgroup…

We describe an algorithm for obtaining generators of the unit group of the integral group ring ZG of a finite abelian group G. We used our implementation in Magma of this algorithm to compute the unit groups of ZG for G of order up to 110.…

During the past three decades fundamental progress has been made on constructing large torsion-free subgroups (i.e. subgroups of finite index) of the unit group $\U (\Z G)$ of the integral group ring $\Z G$ of a finite group $G$. These…

Multiplicative order of an element $a$ of group $G$ is the least positive integer $n$ such that $a^n=e$, where $e$ is the identity element of $G$. If the order of an element is equal to $|G|$, it is called generator or primitive root. This…

The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an…

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…

Let $R$ be a commutative ring with identity. A unit $u$ of $R$ is called exceptional if $1-u$ is also a unit. When $R$ is a finite commutative ring, we determine the additive and multiplicative structures of its exceptional units; and then…

We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…

Let $G$ be the linear algebraic group $SL_3$ over a field $k$ of characteristic two. Let $A$ be a finitely generated commutative $k$-algebra on which $G$ acts rationally by $k$-algebra automorphisms. We show that the full cohomology ring…