Related papers: The codegree isomorphism problem for finite simple…

Finite groups with very few character values are characterized. The following is the main result of this article: a finite non-abelian group has precisely four character values if and only if it is the generalized dihedral group of a…

We prove that if the average of the degrees of the irreducible characters of a finite group $G$ is less than 16/5, then $G$ is solvable. This solves a conjecture of I.M. Isaacs, M. Loukaki, and the first author. We discuss related…

In this paper we characterize groups according to the number of end vertices in the associated coprime graphs. An upper bound on the order of the group that depends on the number of end vertices is obtained. We also prove that $2-$groups…

A number of properties of spherical Artin groups extend to Garside groups, defined as the groups of fractions of monoids where least common multiples exist, there is no nontrivial unit, and some additional finiteness conditions are…

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

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…

In the building of a finite group of Lie type we consider the incidence relations defined by oppositeness of flags. Such a relation gives rise to a homomorphism of permutation modules (in the defining characteristic) whose image is a simple…

Let $\mathbb F$ be an algebraically closed field, $G$ be an abelian group, and let $A$ and $B$ be arbitrary finite-dimensional $G$-graded simple algebras over $\mathbb F$. We prove that $A$ and $B$ are isomorphic if, and only if, they…

It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…

The reality of the difficulties in investigation of finite groups are considered. It is shown that the consideration of symmetry properties of the $k$-orbits that are obtained with an action of a finite group $F=(V,\cdot)$ on Cartesian…

We lay down the fundations of the theory of groups of finite Morley rank in which local subgroups are solvable and we proceed to the local analysis of these groups. We prove the main Uniqueness Theorem, analogous to the Bender method in…

We prove a variant of the Theorem of Ito-Michler, investigating the properties of finite groups where a prime number $p$ does not divide the degree of any irreducible character left invariant by some Galois automorphism $\sigma$ of order…

We give a survey of recent results related to the problem of characterizing finite-dimensional division algebras by the set of isomorphism classes of their maximal subfields. We also discuss various generalizations of this problem and some…

For a finite group $G$ and a positive integer $n$, let $G(n)$ be the set of all elements in $G$ such that $x^{n}=1$. The groups $G$ and $H$ are said to be of the same (order) type if $G(n)=H(n)$, for all $n$. The main aim of this paper is…

A supercharacter theory for a finite group $G$ is a set of superclasses each of which is a union of conjugacy classes together with a set of sums of irreducible characters called supercharacters that together satisfy certain compatibility…

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…

In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated…

Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…

This paper reproduces the text of a part of the Author's DPhil thesis. It gives a proof of the classification of non-trivial, finite homogeneous geometries of sufficiently high dimension which does not depend on the classification of the…

The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…