Related papers: Large even order character sums

Let $P$ be a subset of the primes of lower density strictly larger than $\frac12$. Then, every sufficiently large even integer is a sum of four primes from the set $P$. We establish similar results for $k$-summands, with $k\geq 4$, and for…

We have derived explicit expressions for the sum rules of order one of the eigenvalues of the negative Laplacian on two dimensional domains of arbitrary shape. Taking into account the leading asymptotic behavior of these eigenvalues, as…

Let G be a finite non-abelian simple group and let p be a prime. We classify all pairs (G,p) such that the sum of the complex irreducible character degrees of G is greater than the index of a Sylow p-subgroup of G. Our classification…

We give a Belyi-type characterisation of smooth complete intersections of general type over $\mathbb{C}$ which can be defined over $\bar{\mathbb{Q}}$. Our proof uses the higher-dimensional analogue of the Shafarevich boundedness conjecture…

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 establish that three well-known and rather different looking conjectures about Dirichlet characters and their (weighted) sums, (concerning the P\'{o}lya-Vinogradov theorem for maximal character sums, the maximal admissible range in…

Renyi's result on the density of integers whose prime factorizations have excess multiplicity has an analogue for polynomials over a finite field.

In this paper we study quadratic forms which are universal when restricted to almost prime inputs, establishing finiteness theorems akin to the Conway--Schneeberger 15 theorem.

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…

In this paper, we prove Lusztig's conjecture for finite special linear groups, i.e., we show that characteristic functions of character sheaves coincide with almost characters up to scalar constants, under the condition that the…

Various algebraic properties of Heilbronn's exponential sum can be deduced through the use of supercharacter theory, a novel extension of classical character theory due to Diaconis-Isaacs and Andre. This perspective yields a variety of…

It is shown that every sufficiently large even integer is a sum of two primes and exactly 13 powers of 2. Under the Generalized Rieman Hypothesis one can replace 13 by 7. Unlike previous work on this problem, the proof avoids numerical…

We prove an identity between three infinite families of polynomials which are defined in terms of `bosonic', `fermionic', and `one-dimensional configuration' sums. In the limit where the polynomials become infinite series, they give…

A supercharacter theory for a finite group $G$ is a set of superclasses each of which is a union of conjugacy classes together with a set of sums of irreducible characters called supercharacters that together satisfy certain compatibility…

Choose a polynomial $f$ uniformly at random from the set of all monic polynomials of degree $n$ with integer coefficients in the box $[-L,L]^n$. The main result of the paper asserts that if $L=L(n)$ grows to infinity, then the Galois group…

A classical theorem of John Thompson on character degrees asserts that if the degree of every ordinary irreducible character of a finite group $G$ is 1 or divisible by a prime $p$, then $G$ has a normal $p$-complement. We obtain a…

We construct supercharacter theories of finite unipotent groups in the orthogonal, symplectic and unitary types. Our method utilizes group actions in a manner analogous to that of Diaconis and Isaacs in their construction of supercharacters…

By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…

Higher Lie characters form a distinguished family of symmetric group characters, which appear in many areas of algebra and combinatorics. An old open problem of Thrall is to decompose them into irreducibles. We propose a novel asymptotic…

We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…