Related papers: Computing in unipotent and reductive algebraic gro…

For simple algebraic groups defined over algebraically closed fields of good characteristic, we give upper bounds on the covering numbers of unipotent conjugacy classes in terms of their (co)ranks and in terms of their dimensions.

The set of strata of a reductive group can be viewed as an enlargement of the set of unipotent classes. In this paper the notion of distinguished unipotent class is extended to this larger set. The strata of a Weyl group are introduced and…

Our aim in this paper is to initiate the study of exponent semigroups for rational matrices. We prove that every numerical semigroup is the exponent semigroup of some rational matrix. We also obtain lower bounds on the size of such matrices…

Let $k$ be an arbitrary field. We classify the maximal reductive subgroups of maximal rank in any classical simple algebraic $k$-group in terms of combinatorial data associated to their indices. This result complements [S, 2022], which does…

A combing is a set of normal forms for a finitely generated group. This article investigates the language-theoretic and geometric properties of combings for nilpotent and polycyclic groups. It is shown that a finitely generated class 2…

We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…

We call an affine algebraic supergroup quasireductive if its underlying algebraic group is reductive. We obtain some results about the structure and representations of reductive supergroups.

We show the existence of a unitriangular basic set for unipotent blocks simple reductive groups of classical type in bad characteristic with some exceptions. Then,we introduce an algorithm to count irreducible unipotent Brauer characters…

In this paper we prove a new characterization of the distinguished unipotent orbits of a connected reductive group over an algebraically closed field of characteristic 0. For classical groups we prove the characterization by a combinatorial…

Anyons obtained from a finite gauge theory have a computational power that depends on the symmetry group. The relationship between group structure and computational power is discussed in this paper. In particular, it is shown that anyons…

We classify the irreducible representations of smooth, connected affine algebraic groups over a field, by tackling the case of pseudo-reductive groups. We reduce the problem of calculating the dimension for pseudo-split pseudo-reductive…

Following Isaacs (see [Isa08, p. 94]), we call a normal subgroup N of a finite group G large, if $C_G(N) \leq N$, so that N has bounded index in G. Our principal aim here is to establish some general results for systematically producing…

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

This paper is about nilpotent orbits of reductive groups over local non-Archimedean fields. In this paper we will try to identify for which groups there are only finitely many nilpotent orbits, for which groups the nilpotent orbits are…

This paper initiates the study of effective twisted conjugacy separability for finitely generated groups, which measures the complexity of separating distinct twisted conjugacy classes via finite quotients. The focus is on nilpotent groups,…

Coclass theory has been a highly successful approach towards the investigation and classification of finite nilpotent groups. Here we suggest a similar approach for finite nilpotent semigroups. This differs from the group theory setting in…

We give a unified description of twisted forms of classical reductive groups schemes. Such group schemes are constructed from algebraic objects of finite rank, excluding some exceptions of small rank. These objects, augmented odd form…

We know that any finite abelian group $G$ appears as a subgroup of infinitely many multiplicative groups $\mathbb{Z}_n^\times$ (the abelian groups of size $\phi(n)$ that are the multiplicative groups of units in the rings…

The parameter coclass has been used successfully in the study of nilpotent algebraic objects of different kinds. In this paper a definition of coclass for nilpotent semigroups is introduced and semigroups of coclass 0, 1, and 2 are…

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…