Related papers: Extremely strong Shoda pairs with \texttt{GAP}
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…
This article determines the structure of the group ring $\mathbb{Z}_nG$, where $G$ is a finite group and $\mathbb{Z}_n$ is the ring of integers modulo $n$, such that $n$ is relatively prime to the order of $G$. The decomposition of…
A finite group is said to be weakly separable if every algebraic isomorphism between two $S$-rings over this group is induced by a combinatorial isomorphism. In the paper we prove that every abelian weakly separable group belongs to one of…
A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…
Our original aim was, in Abelian group theory to prove the consistency of: lambda is strong limit singular and for some properties of abelian groups which are relatives of being free, the compactness in singular fails. In fact this should…
Let $\mathrm G / F$ be a reductive split $p$-adic group and let $\mathrm U$ be the unipotent radical of a Borel subgroup. We study the cohomology with trivial $\mathbb Z_p$-coefficients of the profinite nilpotent group $N = \mathrm…
The Gruenberg-Kegel graph $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of order $rs$…
Let $M$ be a cancellative and commutative monoid. A non-invertible element of $M$ is called an atom (or irreducible element) if it cannot be factored into two non-invertible elements, while an atom $a$ of $M$ is called strong if $a^n$ has a…
A pair $(G,T)$ is called a faithful odd transposition group if $T$ is a normal set of involutions generating the group $G$ and the product of any two distinct elements of $T$ has odd order. We introduce a special subclass of such groups, a…
In this communication, the co-maximal subgroup graph $\Gamma(G)$ of a finite group $G$ is examined when $G$ is a finite nilpotent group, finite abelian group, dihedral group $D_n$, dicyclic group $Q_{2^n}$, and $p$-group. We derive the…
The normaliser problem takes as input subgroups $G$ and $H$ of the symmetric group $S_n$, and asks one to compute $N_G(H)$. The fastest known algorithm for this problem is simply exponential, whilst more efficient algorithms are known for…
A closed subgroup of a semisimple algebraic group is called irreducible if it lies in no proper parabolic subgroup. In this paper we classify all irreducible subgroups of exceptional algebraic groups $G$ which are connected, closed and…
Let $\Lambda$ be a countably infinite property (T) group, and let $D$ be UHF-algebra of infinite type. We prove that there exists a continuum of pairwise non (weakly) cocycle conjugate, strongly outer actions of $\Lambda$ on $D$. The proof…
Let $G$ be a countable group. We introduce several equivalence relations on the set ${\rm Sub}(G)$ of subgroups of $G$, defined by properties of the quasi-regular representations $\lambda_{G/H}$ associated to $H\in {\rm Sub}(G)$ and compare…
Irreducible representations (irreps) of a finite group $G$ are equivalent if there exists a similarity transformation between them. In this paper, we describe an explicit algorithm for constructing this transformation between a pair of…
We consider positive entropy $G$-systems for certain countable, discrete, infinite left-orderable amenable groups $G$. By undertaking local analysis, the existence of asymptotic pairs and chaotic sets will be studied in connecting with the…
For a group G we consider the set of natural numbers n for which the nth cohomology functor of G commutes with filtered colimit systems of coefficient modules. We find that for the large class of hierarchically decomposable groups there is…
We study in detail the profinite group G arising as geometric \'etale iterated monodromy group of an arbitrary quadratic polynomial over a field of characteristic different from two. This is a self-similar closed subgroup of the group of…
A group G is called bounded if every conjugation-invariant norm on G has finite diameter. We introduce various strengthenings of this property and investigate them in several classes of groups including semisimple Lie groups, arithmetic…
We propose an algorithm which for any recursive group $G$, given by its effectively enumerable generators and recursively enumerable relations, outputs an explicit embedding of $G$ into a finitely presented group directly written by its…