Related papers: A Database of Groups with Equivalent Character Tab…

We show how the character tables of the groups $E_6(q)_{\text{ad}}$ and ${^2\!E}_6(q)_{\text{ad}}$ can be constructed, where $q$ is a power of~$2$. (Partial results are also obtained for any $q$ not divisible by~$3$.) This is based on…

We compute the character tables of the following groups with character theoretic methods, using known information about the conjugacy classes and about the character tables of some subgroups and factor groups: $Th$, $J_4$, $2.{}^2E_6(2)$,…

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…

The category $\mathbf{XSq}$ of crossed squares is equivalent to the category $\mathbf{Cat2}$ of cat$^2$-groups. Functions for computing with these structures have been developed in the package $\mathsf{XMod}$ written using the…

While efficient algorithms are known for solving many important problems related to groups, no efficient algorithm is known for determining whether two arbitrary groups are isomorphic. The particular case of 2-nilpotent groups, a special…

The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…

The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…

The paper deals with the problem of deciding if two finite-dimensional linear subspaces over an arbitrary field are identical up to a permutation of the coordinates. This problem is referred to as the permutation code equivalence. We show…

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…

The problem of classifying equivalence classes of presentations up to isomorphism of Cayley graphs is considered in this article in the case of dicyclic groups. The number of equivalence classes of presentations is uniformly bounded - it is…

The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…

Modern graph or network datasets often contain rich structure that goes beyond simple pairwise connections between nodes. This calls for complex representations that can capture, for instance, edges of different types as well as so-called…

The computational complexity of the graph isomorphism problem is considered to be a major open problem in theoretical computer science. It is known that testing isomorphism of chordal graphs is polynomial-time equivalent to the general…

In this paper, an effort is made to classify which prime character degree graphs having eight vertices occur for some finite solvable group. To approach this, we compile known results and constructions from the literature which are used to…

The computational cost of simulating quantum many-body systems can often be reduced by taking advantage of physical symmetries. While methods exist for specific symmetry classes, a general algorithm to find the full permutation symmetry…

We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the special case of abelian groups and present an optimal…

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…

Together with David Schlang we computed the discriminants of the invariant Hermitian forms for all indicator $o$ even degree absolutely irreducible characters of the ATLAS groups supplementing the tables of orthogonal determinants computed…

In this paper we consider finite groups G satisfying the following condition: G has two columns in its character table which differ by exactly one entry. It turns out that such groups exist and they are exactly the finite groups with a…

We consider heuristic algorithm for solving graph isomorphism problem. The algorithm based on a successive splitting of the eigenvalues of the matrices which are modifications (to positive defined) of graphs' adjacency matrices.…