Related papers: Groups whose orders factorise into at most four pr…
The degree pattern of a finite group is the degree sequence of its prime graph in ascending order of vertices. We say that the problem of OD-characterization is solved for a finite group if we determine the number of pairwise nonisomorphic…
In this paper, we address computational questions surrounding the enumeration of non-isomorphic Andr\'e planes for any prime power order. We are particularly focused on providing a complete enumeration of all such planes for relatively…
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…
In a finite group, a subset is called a Lagrange subset if its size divides the group order, and a factor if it admits a complementary subset. We provide a new and comparatively direct proof of the classification of groups in which every…
We initiate a systematic study of the perfection of affine group schemes of finite type over fields of positive characteristic. The main result intrinsically characterises and classifies the perfections of reductive groups, and obtains a…
The purpose of this text is to provide an accessible introduction to a set of recently developed algorithms for factorizing matrices. These new algorithms attain high practical speed by reducing the dimensionality of intermediate…
We construct a class of II_1 factors M that admit unclassifiably many Cartan subalgebras in the sense that the equivalence relation of being conjugate by an automorphism of M is complete analytic, in particular non Borel. We also construct…
Classifying isomorphism classes of group gradings on algebras presents a compelling challenge, particularly within the realms of non-simple and infinite-dimensional algebras, which have been relatively unexplored. This study focuses on a…
The Profinite Isomorphism Problem for a class of groups \mathcal{C} asks for an algorithm that decides for any two groups in \mathcal{C} whether they have isomorphic profinite completions. We present the positive solution to this problem…
Two groups are said to have the same character table if a permutation of the rows and a permutation of the columns of one table produces the other table. The problem of determining when two groups have the same character table is…
We revise the enumeration of the imprimitive rank two quaternionic reflection groups, adding missing groups and establishing isomorphisms between groups in the published tables. The isomorphisms are obtained as a consequence of the…
The same-order type $\tau_e(G)$ of a finite group $G$ is a set formed of the sizes of the equivalence classes containing the same order elements of $G$. In this paper, we study an arithmetical property of this set. More exactly, we outline…
The graded Lie algebra associated with the Nottingham group over a field of prime characteristic serves as a fundamental example of Nottingham algebras, a class of infinite-dimensional, positively graded thin algebras. This paper completes…
For primes $p,e>2$ there are at least $p^{e-3}/e$ groups of order $p^{2e+2}$ that have equal multisets of isomorphism types of proper subgroups and proper quotient groups, isomorphic character tables, and power maps. This obstructs recent…
Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…
In this work the algorithms of fast multiplication of matrices are considered. To any algorithm there associated a certain group of automorphisms. These automorphism groups are found for some well-known algorithms, including algorithms of…
Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…
This is the second one in a series of papers classifying the factorizations of almost simple groups with nonsolvable factors. In this paper we deal with almost simple unitary groups.
For $n > 2$, let $\Gamma$ denote either $SL(n, Z)$ or $Sp(n, Z)$. We give a practical algorithm to compute the level of the maximal principal congruence subgroup in an arithmetic group $H\leq \Gamma$. This forms the main component of our…
We study finite p-groups G of coclass upto 4 for which the group Aut_z(G) of all central automorphisms of G is of minimal possible order. As a consequence, we obtain very short and elementary proofs of main results of Sharma and Gumber [7].