Related papers: Character Levels and Character Bounds

We obtain a Burgess-type bound for character sums over unions of intervals. The result follows from the argument of Heath-Brown, with an improvement in one of the steps.

There has been some interest on how the average character degree affects the structure of a finite group. We define, and denote by $ \mathrm{anz}(G) $, the average number of zeros of characters of a finite group $ G $ as the number of zeros…

In the first chapters, this paper contains a survey on the theory of ordinary characters of finite reductive groups with non-connected centre. The last chapters are devoted to the proof of Lusztig's conjecture on characteristic functions of…

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…

We estimate mixed character sums of polynomial values over elements of a finite field $\mathbb F_{q^r}$ with sparse representations in a fixed ordered basis over the subfield $\mathbb F_q$. First we use a combination of the…

The paper relates character value of an irreducible representation of a compact connected Lie group at certain elements of finite order with the dimension of a representation on another group, up to some precise constants, which all have…

We propose upper bounds for the number of modular constituents of the restriction modulo $p$ of a complex irreducible character of a finite group, and for its decomposition numbers, in certain cases.

Using a general result of Lusztig, we find the decomposition into irreducibles of certain induced characters of the projective general linear group over a finite field of odd characteristic.

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…

Berkovich, Chillag and Herzog characterized all finite groups $G$ in which all the nonlinear irreducible characters of $G$ have distinct degrees. In this paper we extend this result showing that a similar characterization holds for all…

We consider sequences of degrees of ordinary irreducible $S_n$-characters. We assume that the corresponding Young diagrams have rows and columns bounded by some linear function of $n$ with leading coefficient less than one. We show that any…

Previous work has modeled the compositionality of words by creating character-level models of meaning, reducing problems of sparsity for rare words. However, in many writing systems compositionality has an effect even on the…

We present an explicit formula for subregular characters (i.e, irreducible finite-dimensional complex characters of submaximal degree) of the unitriangular group over a finite field of sufficiently large characteristic.

When n is odd, consider the finite general linear and unitary groups of rank n, extended by the inverse transpose automorphism. There are elements in the extended groups which square to a regular unipotent element, and we evaluate the…

If a group $G$ is $\pi$-separable, where $\pi$ is a set of primes, the set of irreducible characters $\operatorname{B}_{\pi}(G) \cup \operatorname{B}_{\pi'}(G)$ can be defined. In this paper, we prove that there are variants of some…

We develop a flexible technique to bound the characters of symmetric groups, via the Naruse hook length formula, the Larsen--Shalev character bounds, and appropriate diagram slicings. It allows us to prove a uniform exponential character…

We define and study supercharacters of the classical finite unipotent groups of symplectic and orthogonal types (over any finite field of odd characteristic). We show how supercharacters for groups of those types can be obtained by…

We establish vanishing results for limits of characters in various discrete groups, most notably irreducible lattices in higher rank semisimple Lie groups. As an application, we show that any sequence of finite-dimensional representations…

Let G be a finite group and N be a non-trivial normal subgroup of G, such that the average character degree of irreducible characters in Irr(G|N) is less than or equal to 16=5. Then we prove that N is solvable. Also, we prove the…

Language tasks involving character-level manipulations (e.g., spelling corrections, arithmetic operations, word games) are challenging for models operating on subword units. To address this, we develop a causal intervention framework to…