Related papers: supercharacter table of certain finite groups

We investigate a beautiful conjecture of T. Wilde on character values and element orders of finite groups. We reduce it to a statement on nearly simple groups that can be checked ``prime by prime". For these groups, we show that a strong…

We consider groups where the centers of the irreducible characters form a chain. We obtain two alternate characterizations of these groups, and we obtain some information regarding the structure of these groups. Using our results, we are…

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…

We study an analogue of the Herbrand-Ribet theorem, and its refinement by Mazur and Wiles, in graph theory. For an odd prime number $p$, we let $\mathbb{F}_{p}$ and $\mathbb{Z}_{p}$ denote the finite field with $p$ elements and the ring of…

Computations of Miller and Scheinerman suggest that the vast majority of the zeros appearing in the character table of the symmetric group are of a certain special type. While we cannot prove this, we resolve a conjecture arising in their…

An invertible matrix is called a Perron similarity if it diagonalizes an irreducible, nonnegative matrix. Each Perron similarity gives a nontrivial polyhedral cone, called the spectracone, and polytope, called the spectratope, of realizable…

We describe certain almost-simple algebraic supergroups over an algebraically closed field of odd or zero characteristic. In addition to supergroups with simple Lie superalgebras from Kac's theorem, we construct new supergroups whose Lie…

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…

It is generally believed (and for the most part is probably true) that Lie theory, in contrast to the characteristic zero case, is insufficient to tackle the representation theory of algebraic groups over prime characteristic fields.…

We construct a hierarchy of supersymmetric string theories by showing that the general N-extended superstrings may be viewed as a special class of the (N+1)-extended superstrings. As a side result, we find a twisted (N+2) superconformal…

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 give a complete list of indecomposable characters of the infinite symmetric semigroup. In comparison with the analogous list for the infinite symmetric group, one should introduce only one new parameter, which has a clear combinatorial…

Let p be a prime larger than 3 and let G be a finite group. We prove that G is p-solvable of p-length at most 2 if there are at most two distinct character degrees relatively prime to p in the principal p-block of G. This generalizes a…

We examine which representations of the absolute Galois group of a field of finite characteristic with image over a finite field of the same characteristic may be constructed by the Galois group's action on the division points of an…

Via counting over finite fields, we derive explicit formulas for the E-polynomials and Euler characteristics of GL(d)- and PGL(d)-character varieties of free groups. We prove a positivity property for these polynomials and relate them to…

There is a long tradition of categorifying combinatorial Hopf algebras by the modules of a tower of algebras (or even better via the representation theory of a tower of groups). From the point of view of combinatorics, such a…

The classification of irreducible, spherical characters of the infinite-dimensional unitary/orthogonal/symplectic groups can be obtained by finding all possible limits of normalized, irreducible characters of the corresponding…

We prove that regular supercuspidal representations of $p$-adic groups are uniquely determined by their character values on very regular elements -- a special class of regular semisimple elements on which character formulae are very simple…

For an arbitrary prime $p$ we prove that the proportion of entries divisible by $p$ in certain columns of the character table of the symmetric group $S_n$ tends to 1 as $n\to\infty$. This is done by finding lower bounds on the number of…

This paper is a continuation of [GLT], which develops a level theory and establishes strong character bounds for finite simple groups of linear and unitary type in the case that the centralizer of the element has small order compared to…