Related papers: Computing in unipotent and reductive algebraic gro…

This paper describes how to use subgroups to parameterize unipotent classes in the classical algebraic group in characteristic 2. These results can be viewed as an extension of the Bala-Carter Theorem, and give a convenient way to compare…

A group is small if it has countably many complete $n$-types over the empty set for each natural number n. More generally, a group $G$ is weakly small if it has countably many complete 1-types over every finite subset of G. We show here…

In the monograph arXiv:2108.03453, we define the notion of a unipotent representation of a complex reductive group. The representations we define include, as a proper subset, all special unipotent representations in the sense of…

We study group algebras for compact groups in the category of real and complex weakly complete vector spaces. We also show that the group algebra is a quotient of the weakly complete universal enveloping algebra of the Lie algebra of the…

We show that there exists an algorithm to decide any single equation in the Heisenberg group in finite time. The method works for all two-step nilpotent groups with rank-one commutator, which includes the higher Heisenberg groups. We also…

Let G be a simple reductive group over the complex numbers. Let W be the Weyl group of G. We propose a description of the Springer representations of W associated to various unipotent classes of G by a purely algebraic method involving the…

A group is irreducibly represented if it has a faithful irreducible unitary representation. For countable groups, a criterion for irreducible representability is given, which generalises a result obtained for finite groups by W. Gasch\"utz…

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…

computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…

We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…

The notion of a \emph{$G$-completely reducible} subgroup is important in the study of algebraic groups and their subgroup structure. It generalizes the usual idea of complete reducibility from representation theory: a subgroup $H$ of a…

We define a notion of roundness for finite groups. Roughly speaking, a group is round if one can order its elements in a cycle in such a way that some natural summation operators map this cycle into new cycles containing all the elements of…

We describe algorithms for computing the induced nilpotent orbits in semisimple Lie algebras. We use them to obtain the induction tables for the Lie algebras of exceptional type. This also yields the classification of the rigid nilpotent…

We give a full classification, up to equivalence, of finite-dimensional graded division algebras over the field of real numbers. The grading group is any abelian group.

Recently there has been a lot of research and progress in profinite groups. We survey some of the new results and discuss open problems. A central theme is decompositions of finite groups into bounded products of subsets of various kinds…

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

We classify finite groups $G$, such that the group algebra, $\mathbb{Q}G$ (over the field of rational numbers $\mathbb{Q}$), is the direct product of the group algebra $\mathbb{Q}[G/N]$ of a proper factor group $G/N$, and some division…

We first provide an overview of several results dealing with the genus of a division algebra and highlight the role of ramification in its analysis. We then give a survey of recent developments on the genus problem for simple algebraic…

Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…

Existentially closed groups are, informally, groups that contain solutions to every consistent finite system of equations and inequations. They were introduced in 1951 in an algebraic context and subsequent research elucidated deep…