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

We describe an easy way how to find supercharacter theories for a finite group, if its character table is known. Namely, we show how an arbitrary partition of the conjugacy classes or of the irreducible characters can be refined to the…

If all of the entries of a large $S_n$ character table are covered up and you are allowed to uncover one entry at a time, then how can you quickly identify all of the indexing characters and conjugacy classes? We present a fast algorithmic…

A classical theorem on character degrees states that if a finite group has fewer than four character degrees, then the group is solvable. We prove a corresponding result on character values by showing that if a finite group has fewer than…

In 1961, Solomon gave upper and lower bounds for the sum of all the entries in the character table of a finite group in terms of elementary properties of the group. In a different direction, we consider the ratio of the character table sum…

Character tables of finite groups and closely related commutative algebras have been investigated recently using new perspectives arising from the AdS/CFT correspondence and low-dimensional topological quantum field theories. Two important…

To determine if two lists of numbers are the same set, we sort both lists and see if we get the same result. The sorted list is a canonical form for the equivalence relation of set equality. Other canonical forms arise in graph isomorphism…

This paper shows that groups of order $64$ are uniquely determined up to isomorphism by their Tables of Marks. This then resolves a previously posed question about whether all groups of order less than $96$ are determined by their Tables of…

In this paper, we reveal an intriguing relationship between two seemingly unrelated notions: letter graphs and geometric grid classes of permutations. An important property common for both of them is well-quasi-orderability, implying, in a…

We classify finite groups with a small average number of zeros in the character table.

Let $X$ be a character table of the symmetric group $S_n$. It is shown that unless $n = 4$ or $n=6$, there is a unique way to assign partitions of $n$ to the rows and columns of $X$ so that for all $\lambda$ and $\nu$, $X_{\lambda\nu}$ is…

It is common for people to create different types of charts to explore a multi-dimensional dataset (table). However, to recommend commonly composed charts in real world, one should take the challenges of efficiency, imbalanced data and…

We prove that finite groups have the same complex character tables iff the group algebras are twisted forms of each other as Drinfel'd quasi-bialgebras or iff there is non-associative bi-Galois algebra over these groups. The interpretations…

We enumerate the 15768 perfect groups of order up to $2\cdot 10^6$, up to isomorphism, thus also completing the missing cases in the prior classification. The work supplements the by now well-understood computer classifications of solvable…

In this paper, some zeros and non-zeros in the character tables of symmetric groups are displayed in the partition forms. In particular, more zeros of self conjugate partitions beside odd permutations are heavily investigated.

We prove a variation of Thompson's Theorem. Namely, if the first column of the character table of a finite group $G$ contains only two distinct values not divisible by a given prime number $p>3$, then $O^{pp'pp'}(G)=1$. This is done by…

A character table $X$ for a saturated fusion system $\mathcal{F}$ on a finite $p$-group $S$ is the square matrix of values associated to a basis of the lattice of virtual $\mathcal{F}$-stable ordinary characters of $S$. We investigate a…

The question of whether there exists a finite group of order at least three in which every element except one is a commutator has remained unresolved in group theory. In this article, we address this open problem by developing an…

Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…

In the classic "Concrete Math", by Graham, Patashnik and Knuth, it is stated that "The numbers in Pascal's triangle satisfy, practically speaking, infinitely many identities, so it is not too surprising that we can find some surprising…

We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…