Related papers: Character Levels and Character Bounds

We prove that a knowledge of the character degrees of a finite group G and of their multiplicities determines whether G has a Sylow p-subgroup as a direct factor. An analogous result based on a knowledge of the conjugacy class sizes was…

We show that the largest character degree of an alternating group $A_n$ with $n\geq 5$ can be bounded in terms of smaller degrees in the sense that \[ b(A_n)^2<\sum_{\psi\in\textrm{Irr}(A_n),\,\psi(1)< b(A_n)}\psi(1)^2, \] where…

C. Andre and N. Yan introduced the idea of a supercharacter theory to give a tractable substitute for character theory in wild groups such as the unipotent uppertriangular group $U_n(F_q)$. In this theory superclasses are certain unions of…

We present a basic pointwise bound for the irreducible characters of $\mathrm{SU}(3)$ and, as an application, derive new $L^p$ bounds for these characters. Our approach is based on the descent of characters to singular sets and the…

Let $G$ be a connected reductive group over $F_q$, where $q$ is large enough and the center of $G$ is connected. We are concerned with Lusztig's theory of {\em character sheaves}, a geometric version of the classical character theory of the…

With a view to determining character values of finite reductive groups at unipotent elements, we prove a number of results concerning inner products of generalised Gelfand-Graev characters with characteristic functions of character sheaves,…

We present a strong upper bound on the number k(B) of irreducible characters of a p-block B of a finite group G in terms of local invariants. More precisely, the bound depends on a chosen major B-subsection (u,b), its normalizer N_G(\langle…

The notion of a supercharacter theory was proposed by P. Diaconis and I.M. Isaacs in 2008. A supercharacter theory for a given finite group is a pair of the system of certain complex characters and the partition of group into classes that…

Identities of complex irreducible representations of finite groups can be explicitly constructed from character value sets. Among other things, these identities determine representations up to Gassmann equivalency. Some examples of…

We prove character sum estimates for additive Bohr subsets modulo a prime. These estimates are analogous to classical character sum bounds of Polya-Vinogradov and Burgess. These estimates are applied to obtain results on recurrence mod $p$…

Let $p$ be a prime. We prove bounds on short Dirichlet character sums evaluated at a class of homogeneous polynomials in arbitrary dimensions. In every dimension, this bound is nontrivial for sums over boxes with side lengths as short as…

Turull has described the fields of values for characters of $SL_n(q)$ in terms of the parametrization of the characters of $GL_n(q)$. In this article, we extend these results to the case of $SU_n(q)$.

In this paper, we propose a general framework that extends the theory of permutation patterns to higher dimensions and unifies several combinatorial objects studied in the literature. Our approach involves introducing the concept of a…

In this paper we study characters on special linear groups SL_n(R), where R is either an infinite field or the localization of an order in a number field. We give several applications to the theory of measure preserving actions,…

We present an overview of characteristic identities for Lie algebras and superalgebras. We outline methods that employ these characteristic identities to deduce matrix elements of finite dimensional representations. To demonstrate the…

This paper proves Burgess bounds for short mixed character sums in multi-dimensional settings. The mixed character sums we consider involve both an exponential evaluated at a real-valued multivariate polynomial, and a product of…

We develop a theory of sesquilinear forms over finite fields, investigating their representations via polynomials and coefficient matrices, along with classification results for these forms. Through their connection to quadratic forms, we…

Robinson showed that the character degrees are determined by knowing, for all $n$, the number of ways that the identity can be expressed as a product of $n$ commutators. Earlier, Strunkov showed that the existence of characters of…

In 1918 Polya and Vinogradov gave an upper bound for the maximal size of character sums which still remains the best known general estimate. One of the main results of this paper provides a substantial improvement of the Polya-Vinogradov…

Even with the introduction of supercharacter theories, the representation theory of many unipotent groups remains mysterious. This paper constructs a family of supercharacter theories for normal pattern groups in a way that exhibit many of…