Related papers: Unipotent Generators for Arithmetic Groups

A generating function of the number of homomorphisms from the fundamental group of a compact oriented or non-orientable surface without boundary into a finite group is obtained in terms of an integral over a real group algebra. We calculate…

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…

A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve…

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 show that strong approximate lattices in higher-rank semi-simple algebraic groups are arithmetic.

We consider the class of finitely generated groups whose relators are powers of commutators of the generators. This class contains as a small subclass graph groups (also called RAAGs), namely if all powers are one. Graph groups are the only…

In this paper we provide concrete constructions of idempotents to represent typical singular matrices over a given ring as a product of idempotents and apply these factorizations for proving our main results. We generalize works due to…

We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by…

Using our recent results on eigenvalues of invariants associated to the Lie superalgebra gl(m|n), we use characteristic identities to derive explicit matrix element formulae for all gl(m|n) generators, particularly non-elementary…

We construct supercharacter theories of finite unipotent groups in the orthogonal, symplectic and unitary types. Our method utilizes group actions in a manner analogous to that of Diaconis and Isaacs in their construction of supercharacters…

In this paper we study generating functions resembling the rank of strongly unimodal sequences. We give combinatorial interpretations, identities in terms of mock modular forms, asymptotics, and a parity result. Our functions imitate a…

Let $k = \mathbb{Q}(\sqrt{\alpha})$ be a real quadratic number field, where $\alpha$ is a positive square-free integer. Let $\mathcal{O}_k$ be the ring of integers of $k$. In this paper, we prove that a certain set of $2 \times 2$ singular…

When we consider a finite abelian group acting linearly on a polynomial ring, we can find monomial generators for the subring of invariants. By Noether's degree bound and Hilbert's finiteness theorem, we know that there are finitely many…

Let G(F_q) be the group of rational points of a simple algebraic group defined and split over a finite field F_q. In this paper we define a new basis for the Grothendieck group of unipotent representations of G(F_q).

All groups have 2 generators. For every prime power q, the Generalized Burnside Theorem (Theorem GB) produces an infinite number of solvable groups, Some, such as groups of a prime power exponent, have only elements of finite order and are…

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…

Let G be a special linear group over the real, the complex or the quaternion, or a special unitary group. In this note, we determine all special unipotent representations of G in the sense of Arthur and Barbasch-Vogan, and show in…

We formulate and prove relative versions of several classical decompositions known in the theory of Chevalley groups over commutative rings. As an application we obtain upper estimates for the width of principal congruence subgroups in…

We characterise the elements of the (maximum) idempotent generated subsemigroup of the Kauffman monoid in terms of combinatorial data associated to certain normal forms. We also calculate the smallest size of a generating set and idempotent…

We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…