Related papers: Computing in unipotent and reductive algebraic gro…

We provide an explicit construction for a complete set of orthogonal primitive idempotents of finite group algebras over nilpotent groups. Furthermore, we give a complete set of matrix units in each simple epimorphic image of a finite group…

This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…

For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…

We sketch a simplification of proofs of old results on the arithmeticity of the group generated by opposing integral unipotent radicals in higher rank arithmetic groups

We compute special unipotent Arthur packets for real reductive groups in many cases. We list the cases that lead to incomplete answers, and in those cases, provide a suitable set of representations that could lead to a complete description…

Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general…

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…

Let $G$ be a finite solvable group. Then $G$ always has a useful presentation, which we call a "long presentation". Using a "long presentation" of $G$, we present an inductive method of constructing the irreducible representations of $G$…

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

Let G be a connected reductive algebraic group over an algebraic closed field. We define a (surjective) map from the set of conjugacy classes in the Weyl group to the set of unipotent classes of G.

We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…

A p-group is called powerful if every commutator is a product of pth powers when p is odd and a product of fourth powers when p=2. In the group algebra of a group G of p-power order over a finite field of characteristic p, the group of…

A connected algebraic group in characteristic 0 is uniquely determined by its Lie algebra. In this paper an algorithm is given for constructing an algebraic group in characteristic 0, given its Lie algebra. Using this an algorithm is…

We develop a general approach to the study of maximal nilpotent subsemigroups of finite semigroups. This approach can be used to recover many known classifications of maximal nilpotent subsemigroups, in particular, for the symmetric inverse…

Suppose $G$ is a real reductive group. The determination of the irreducible unitary representations of $G$ is one of the major unsolved problem in representation theory. There is evidence to suggest that every irreducible unitary…

We develop a structure theory for nilpotent symplectic alternating algebras. We then give a classification of all nilpotent symplectic alternating algebras of dimension up to 10 over any field. The study reveals a new subclasses of powerful…

We show that various properties of unipotent elements in a reductive group over the complex numbers can be recovered purely in terms of the affine Weyl group of the dual group.

We consider the variety of nilpotent elements in the dual of the Lie algebra of a reductive algebraic group over an algebraically closed field. We propose a definition of a partition of this variety into smooth locally closed smooth…

What is computable with limited resources? How can we verify the correctness of computations? How to measure computational power with precision? Despite the immense scientific and engineering progress in computing, we still have only…

We investigate number-theoretic properties of the collection of nilpotent injectors or nilpotent projectors containing certain subgroups of finite soluble (or ${\mathcal N}$-constrained) groups.