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

Graph isomorphism is an important problem as its worst-case time complexity is not yet fully understood. In this study, we try to draw parallels between a related optimization problem called point set registration. A graph can be…

There are two permutation groups that they share the same character table of order 1344. We take up natural representations on 8 and 14 letters respectively. The purpose of this paper is to examine the semi-simple structure of centralizing…

Suppose that all groups of order $n$ are defined on the same set $G$ of cardinality $n$, and let the \emph{distance} of two groups of order $n$ be the number of pairs $(a,b)\in G\times G$ where the two group operations differ. Given a group…

We consider the isomorphism problem for hypergraphs taking as input two hypergraphs over the same set of vertices $V$ and a permutation group $\Gamma$ over domain $V$, and asking whether there is a permutation $\gamma \in \Gamma$ that…

A set of invariants for a finite group is described. These arise naturally from Frobenius' early work on the group determinant and provide an answer to a question of Brauer. Whereas it is well known that the ordinary character table of a…

We employ the recently developed hybrid and mmgroup computational models for groups to calculate the character table of $N(\rm{2B}^5) \cong 2^{5+10+20}.( \rm{S}_3 \times \rm{L}_5 {2} )$, a maximal subgroup of the Monster sporadic simple…

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…

In this work, we study the problem of partitioning a set of graphs into different groups such that the graphs in the same group are similar while the graphs in different groups are dissimilar. This problem was rarely studied previously,…

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…

An applied problem facing all areas of data science is harmonizing data sources. Joining data from multiple origins with unmapped and only partially overlapping features is a prerequisite to developing and testing robust, generalizable…

Let G be a finite group with Sylow p-subgroup P. We show that the character table of G determines whether P has maximal nilpotency class and whether P is a minimal non-abelian group. The latter result is obtained from a precise…

We prove that a finite group is rational if and only if it has a set of permutation characters which separate conjugacy classes. It follows from this that a finite group is rational if and only if it has a representation as a permutation…

The output structure of database-like tables, consisting of values structured in horizontal rows and vertical columns identifiable by name, can cover a wide range of NLP tasks. Following this constatation, we propose a framework for…

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…

We study the zero-sharing behavior among irreducible characters of a finite group. For symmetric groups $S_n$, it is proved that, with one exception, any two irreducible characters have at least one common zero. To further explore this…

In this paper we prove that any finite group of order $n$ can be viewed as the group of the solutions of a certain matrix equation $XB=BY$, where the unknowns $X,Y$ are two permutation matrices of order $n$ and $(1+k)n+2 $ respectively and…

The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A group $G$ is recognisable by its prime graph…

A (2,*)-group is a group that can be generated by two elements, one of which is an involution. We describe the method we have used to produce a census of all (2,*)-groups of order at most 6 000. Various well-known combinatorial structures…

One way of expressing the self-duality $A\cong \Hom(A,\mathbb{C})$ of Abelian groups is that their character tables are self-transpose (in a suitable ordering). Noncommutative groups fail to satisfy this property. In this paper we extend…

The character theory of finite groups has numerous basic questions that are often already quite involved: enumerating of irreducible characters, their character formulas, point-wise product decompositions, and restriction/induction between…