Related papers: Additive double character sums over some structure…
In this article, we investigate the conditional large values of quadratic Dirichlet character sums. We prove an Omega result for quadratic character sums under the assumption of the generalized Riemann hypothesis.
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…
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…
In this note we analyze two algorithms, one for producing a matching and one for an independent set, on $k$-uniform $d$-regular hypergraphs of large girth. As a result we obtain new lower bounds on the size of a maximum matching or…
Hybrid character sums are an important class of exponential sums which have nice applications in coding theory and sequence design. Let $\gf_{p^m}$ be the finite field with $p^m$ elements for a prime $p$ and a positive integer $m$. Let…
We study the double character sum $\sum\limits_{\substack{m\leq X,\\m\odd}}\sum\limits_{\substack{n\leq Y,\\n\odd}}\leg mn$ and its smoothly weighted counterpart. An asymptotic formula with power saving error term was obtained by Conrey,…
A set of non-negative integers A is an additive 2-basis with range n, if its sumset A+A contains 0, 1, ..., n but not n+1. Explicit bases are known with arbitrarily large size |A|=k and $n/k^2 \ge 2/7 > 0.2857$. We present a more general…
This is a survey of the existing literature, the state of the art, and a few minor new results and open questions regarding the essential dimension of central simple algebras and finite sequences of such algebras over fields whose…
In this paper we provide asymptotic upper bounds on the complexity in two (closely related) situations. We confirm for the total doubling coverings and not only for the chains the expected bounds of the form $$ \kappa({\mathcal U}) \le…
In their seminal paper from 1983, Erd\H{o}s and Szemer\'edi showed that any $n$ distinct integers induce either $n^{1+\epsilon}$ distinct sums of pairs or that many distinct products, and conjectured a lower bound of $n^{2-o(1)}$. They…
In the first paper of this series we established new upper bounds for multi-variable exponential sums associated with a quadratic form. The present study shows that if one adds a linear term in the exponent, the estimates can be further…
We consider a class of double exponential sums studied in a paper of Sinai and Ulcigrai. They proved a linear bound for these sums along the sequence of denominators in the continued fraction expansion of $\alpha$, provided $\alpha$ is…
We examine double successive approximations on a set, which we denote by $L_2L_1, \ U_2U_1, U_2L_1,$ $L_2U_1$ where $L_1, U_1$ and $L_2, U_2$ are based on generally non-equivalent equivalence relations $E_1$ and $E_2$ respectively, on a…
We consider relative character varieties on $\mathbb{P}^1\backslash\{0,1,\infty\}$ with $G=GL(r), O(r)$, or $Sp(r)$. Using a diagrammatic method of Simpson's, we give an explicit linear upper bound $R(d)$ on the rank $r$ of an MC-minimal…
Let D be a connected component of a reductive group over an algebraically closed field. We define a surjective map from the unipotent character sheaves on D to the set of strata of D, extending an earlier result which applied to connected…
We study the sizes of delta-additive sets of unit vectors in a d-dimensional normed space: the sum of any two vectors has norm at most delta. One-additive sets originate in finding upper bounds of vertex degrees of Steiner Minimum Trees in…
We show that even mild improvements of the Polya-Vinogradov inequality would imply significant improvements of Burgess' bound on character sums. Our main ingredients are a lower bound on certain types of character sums (coming from works of…
This paper investigates the theory of sum-rank metric codes for which the individual matrix blocks may have different sizes. Various bounds on the cardinality of a code are derived, along with their asymptotic extensions. The duality theory…
The entropic doubling $\sigma_{\operatorname{ent}}[X]$ of a random variable $X$ taking values in an abelian group $G$ is a variant of the notion of the doubling constant $\sigma[A]$ of a finite subset $A$ of $G$, but it enjoys somewhat…
We introduce and study some families of groups whose irreducible characters take values on quadratic extensions of the rationals. We focus mostly on a generalization of inverse semi-rational groups, which we call uniformly semi-rational…