Related papers: A Short Character Sum in $\mathbb{F}_{p^3}$
We obtain an explicit formula for the mock theta function $\Phi^{[m,s]}$ in the case when either $m$ or $s$ is a half of an odd integer by using the coroot lattice of $D(2,1;a)$. This enables us, together with the recurrence formula for…
A general method to express in terms of Gauss sums the number of rational points of subschemes of projective schemes over finite fields is applied to the image of the triple embedding $\mathbb{P}^1\hookrightarrow\mathbb{P}^3$. As a…
For a finite group $G$, we denote by $c(G)$, the minimal degree of faithful representation of $G$ by quasi-permutation matrices over the complex field $\mathbb{C}$. For an irreducible character $\chi$ of $G$, the codegree of $\chi$ is…
In this note, we give explicit expressions of Gauss sums for general (resp. special) linear groups over finite fields, which involves Gauss sums (resp. Kloosterman sums). The key ingredient is averaging such sums over Borel subgroups. As…
Error bounds are central objects in optimization theory and its applications. They were for a long time restricted only to the theory before becoming over the course of time a field of itself. This paper is devoted to the study of error…
We give closed product formulas for the irreducible characters of the symmetric groups related to rectangular `almost square' Young diagrams $p \times(p+\delta)$ for a fixed value of an integer $\delta$ and an arbitrary integer $p$.
For any given integer $k\geq 2$ we prove the existence of infinitely many $q$ and characters $ \chi\pmod q$ of order $k$, such that $|L(1,\chi)|\geq (e^{\gamma}+o(1))\log\log q$. We believe this bound to be best possible. When the order $k$…
Let ${\mathcal H}$ be a multiplicative subgroup of $\mathbb{F}_p^*$ of order $H>p^{1/4}$. We show that $$ \max_{(a,p)=1}\left|\sum_{x\in {\mathcal H}} {\mathbf{\,e}}_p(ax)\right| \le H^{1-31/2880+o(1)}, $$ where ${\mathbf{\,e}}_p(z) =…
A few elementary estimates of a basic character sum over the prime numbers are derived here. These estimates are nontrivial for character sums modulo large q. In addition, an omega result for character sums over the primes is also included.
We obtain explicit bounds on the moments of character sums, refining estimates of Montgomery and Vaughan. As an application we obtain results on the distribution of the maximal magnitude of character sums normalized by the square root of…
We study irreducible restrictions from modules over alternating groups to subgroups. We get reduction results which substantially restrict the classes of subgroups and modules for which this is possible. This is known when the…
We present new estimates for sums of the divisor function, and other similar arithmetic functions, in short intervals over function fields. (When the intervals are long, one obtains a good estimate from the Riemann hypothesis.) We obtain an…
Let $R$ be a finite ring and define the hyperbola $H=\{(x,y) \in R \times R: xy=1 \}$. Suppose that for a sequence of finite odd order rings of size tending to infinity, the following "square root law" bound holds with a constant $C>0$ for…
In this paper we consider transformation formulas for \[ B\left( z,s:\chi\right) =\sum\limits_{m=1}^{\infty}\sum\limits_{n=0} ^{\infty}\chi(m)\chi(2n+1)\left( 2n+1\right) ^{s-1}e^{\pi im(2n+1)z/k}. \] We derive reciprocity theorems for the…
Based on a variant of Sury's polynomial identity we derive new expressions for various finite Fibonacci (Lucas) sums. We extend the results to Fibonacci and Chebyshev polynomials, and also to Horadam sequences. In addition to deriving sum…
This is the first in a series of three papers dealing with sums of squares and hypoellipticity in the infinite regime. We give a sharp sufficient condition on a smooth nonnegative function f on n-dimensional Euclidean space so that it can…
Recently, a strong exponential character bound has been established in [3] for all elements $g \in \mathbf{G}^F$ of a finite reductive group $\mathbf{G}^F$ which satisfy the condition that the centraliser $C_{\mathbf{G}}(g)$ is contained in…
Let $\mathbb{F}_q$ be a finite field with $q$ elements, where $q$ is the power of an odd prime, and let $\mathrm{GSp}(2n, \mathbb{F}_q)$ and $\mathrm{GO}^{\pm}(2n, \mathbb{F}_q)$ denote the symplectic and orthogonal groups of similitudes…
We prove a character sum identity for Coxeter arrangements which is a finite field analogue of Macdonald's conjecture proved by Opdam.
Given a finite lattice $L$ that can be embedded in the recursively enumerable (r.e.) Turing degrees $\mathcal{R}_{\mathrm{T}}$, it is not known how one can characterize the degrees $\mathbf{d}\in\mathcal{R}_{\mathrm{T}}$ below which $L$ can…