Related papers: Computing the Zariski closure of a finitely genera…

We develop practical techniques to compute with arithmetic groups $H\leq \mathrm{SL}(n,\mathbb{Q})$ for $n>2$. Our approach relies on constructing a principal congruence subgroup in $H$. Problems solved include testing membership in $H$,…

We determine the number of isomorphism classes of elementary gradings by a finite group on an algebra of upper block-triangular matrices. As a consequence we prove that, for a finite abelian group $G$, the sequence of the numbers $E(G,m)$…

In this article, we study connections between components of the Cayley graph $\mathrm{Cay}(G,A)$, where $A$ is an arbitrary subset of a group $G$, and cosets of the subgroup of $G$ generated by $A$. In particular, we show how to construct…

The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…

In this paper, we present a novel approach for calculating the set of subgroups of a finite group, focusing on cyclic subgroups, and using it to establish the quantity of all subgroups in the direct product of two groups. Specifically, we…

We generalize an algorithm established in earlier work \cite{algebrapaper} to compute finitely many generators for a subgroup of finite index of an arithmetic group acting properly discontinuously on hyperbolic space of dimension $2$ and…

The $n$-th Zariski topology on a group $G$ is generated by the sub-base consiting of the cozero sets of monomials of degree $\le n$ on $G$. We prove that for each group $G$ the 2-nd Zariski topology is not discrete and present an example of…

Arithmetic groups are groups of matrices with integral entries. We shall first discuss their origin in number theory (Gauss, Minkowski) and their role in the "reduction theory of quadratic forms". Then we shall describe these groups by…

We announce results about the structure and arithmeticity of all possible lattice embeddings of a class of countable groups which encompasses all linear groups with simple Zariski closure, all groups with non-vanishing first l2-Betti…

In this paper we explore the structure and properties of C-groups. We define a C-group as a group $G$ with $rk(G) < rk(Z(G))$ (where $rk(G)$ is the minimal cardinal of a generating set for a group $G$). Using GAP (a group theory program)…

By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…

Previous formulations of group theory in ACL2 and Nqthm, based on either "encapsulate" or "defn-sk", have been limited by their failure to provide a path to proof by induction on the order of a group, which is required for most interesting…

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case…

We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…

We generalize Hrushovski's Group Configuration Theorem to quasiminimal classes. As an application, we present Zariski-like structures, a generalization of Zariski geometries, and show that a group can be found there if the pregeometry…

A unifying overview of the ways to parameterize the linear group GL(4.C) and its subgroups is given. As parameters for this group there are taken 16 coefficients G = G(A,B,A_{k}, B_{k}, F_{kl}) in resolving matrix G in terms of 16 basic…

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…

Arithmetic Kleinian groups are arithmetic lattices in PSL_2(C). We present an algorithm which, given such a group Gamma, returns a fundamental domain and a finite presentation for Gamma with a computable isomorphism.

Let KG be a group algebra of a finite p-group G over a finite field K of characteristic p. We compute the order of the unitary subgroup of the group of units when G is either an extraspecial 2-group or the central product of such a group…

Algorithms working with linear algebraic groups often represent them via defining polynomial equations. One can always choose defining equations for an algebraic group to be of the degree at most the degree of the group as an algebraic…