Related papers: Computing the unit group of a commutative finite $…
Let $R$ be an associative ring with unity $1$ and consider $k\in \mathbb{N}$ such that $1+1+..+1=k$ is invertible. Denote by $\omega$ an arbitrary kth root of unity in $R$ and let $UT^{(k)}_{\infty}(R)$ be the group of upper triangular…
Structural properties of unitary groups over local, not necessarily commutative, rings are developed, with applications to the computation of the orders of these groups (when finite) and to the degrees of the irreducible constituents of the…
We present a finite algorithm for computing the set of irreducible unitary representations of a real reductive group G. The Langlands classification, as formulated by Knapp and Zuckerman, exhibits any representation with an invariant…
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…
It is proved that any vertex operator algebra for which the image of the Virasoro element in Zhu's algebra is algebraic over complex numbers is finitely generated. In particular, any vertex operator algebra with a finite dimensional Zhu's…
We prove explicit and elementary formulas for the group homology and cohomology of a finite group with coefficients in any module. We describe in elementary terms the cohomology algebra $H^*(G,k)$ as a graded algebra for a finite group $G$…
The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…
Let $p$ be a prime integer and $\mathbb{Z}_p$ be the ring of $p$-adic integers. By a purely computational approach we prove that each nonzero normal element of a completed group algebra over the special linear group ${\rm…
For any ring $R$, we introduce an invariant in the form of a partially ordered abelian semigroup $\mathrm{S}(R)$ built from an equivalence relation on the class of countably generated projective modules. We call $\mathrm{S}(R)$ the Cuntz…
Commutative semirings with divisible additive semigroup are studied. We show that an additively divisible commutative semiring is idempotent, provided that it is finitely generated and torsion. In case that a one-generated additively…
A theorem of O. Forster says that if $R$ is a noetherian ring of Krull dimension $d$, then any projective $R$-module of rank $n$ can be generated by $d+n$ elements. S. Chase and R. Swan subsequently showed that this bound is sharp: there…
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
Two finitely generated groups have the same set of finite quotients if and only if their profinite completions are isomorphic. Consider the map which sends (the isomorphism class of) an S-arithmetic group to (the isomorphism class of) its…
The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…
We prove that every finite simple group of Lie type $G$ can be generated by three regular unipotent elements. In certain cases we show that two regular unipotents are sufficient to generate $G$.
Given a finite tensor category $\ca$, an exact indecomposable $\ca$-module category $\Mo$, and a tensor subcategory $\Do\subseteq \ca^*_\Mo$, we describe a way to produce \textit{exact} commutative algebras in the center $Z(\ca)$, measuring…
In this article, the projectivity of finitely generated flat modules of a commutative ring are studied from a topological point of view. Then various interesting results are obtained. For instance, it is shown that if a ring has either a…
Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…
An approach to representations of finite groups is presented without recourse to character theory. Considering the group algebra C[G] as an algebra of linear maps on C[G] (by left multiplication), we derive the primitive central idempotents…
We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…