arXiv subjects
Publications and source records attributed to Daqing Wan.
We prove that, for every constant $\rho>1$, the Euclidean shortest vector problem is NP-hard to approximate within any constant factor $\rho$ under a deterministic polynomial-time many-one reduction. This extends our previous deterministic NP-hardness result from $\rho<\sqrt 2$ to arbitrary constants and gives a deterministic version of Khot's randomized arbitrary-constant theorem.
We introduce exotic Kloosterman sums and exotic inverted Kloosterman sums attached to non-commutative finite-dimensional semisimple algebras over a finite field $\mathbf{F}_q$, and prove their reduction formulae to exotic Kloosterman and exotic inverted Kloosterman sums over commutative \'etale $\mathbf{F}_q$ algebras. We then obtain square-root estimates for these sums; for inverted sums an explicit correction term may appear.
An asymptotic formula with a square root error term is obtained for the number of elements with given trace and norm in a finite semisimple algebra over a finite field. This extends previous results from finite etale algebras (commutative case) to finite semi-simple algebras (non-commutative case). The main idea is to apply the Eichler formula for Gauss sums over the general linear group and the Hasse-Davenport relation to reduce the problem to the classical geometric case where the result is known to be true. As an application of this reduction, we also obtain a square root estimate for Kloosterman sums over semi-simple algebras. Similar square root estimates are discussed when norm-trace is replaced by product-trace, leading to a new conjecture on product-trace counting over finite semi-simple algebras.
In 1981, van Emde Boas conjectured that computing a shortest non-zero vector of a lattice in a Euclidean space is $\mathbf{NP}$-hard. In this paper, we prove this conjecture, thereby derandomizing Ajtai's classical randomized hardness result (1998). We follow the derandomization program formulated by Micciancio (1998--2014) who conjectured the existence of an efficient deterministic construction of locally dense lattices. The key is to resolve this conjecture. Our proof builds on the candidate construction via Reed-Solomon codes by Bennett and Peikert (2023), and depends crucially on Deligne's work on the Weil conjectures for higher-dimensional varieties over finite fields.
Given an elliptic curve $E$ over $\mathbb{Q}$ and non-zero integer $r$, the Lang--Trotter conjecture predicts a striking asymptotic formula for the number of good primes $p\leqslant x$, denoted by $π_{E,r}(x)$, such that the Frobenius trace of $E$ at $p$ is equal to the given integer $r$. We focus on the CM case in this memoir, and show how to realize the following two goals: (1) to give an unconditional estimate for $π_{E,r}(x)$, which confirms the upper bound part of the conjecture up to a constant multiple; (2) to give a conditional explicit asymptotic formula for $π_{E,r}(x)$ based on the Hardy--Littlewood conjecture on primes represented by quadratic polynomials. For completeness, we also summarize classical results on quadratic, cubic and quartic residues, as well as the corresponding reciprocity laws. This part should be of independent interests and could provide useful materials for more junior readers. We also highlight some possible extensions of the arguments in this memoir that may work for other statistical problems of CM elliptic curves.
We provide new, improved lower bounds for the Hodge and Frobenius colevels of algebraic varieties (over $\mathbf{C}$ or over a finite field) in all cohomological degrees. These bounds are expressed in terms of the dimension of the variety and multi-degrees of its defining equations. Our results lead to an enhanced positive answer to a question raised by Esnault and the first author.
Using basic properties of perverse sheaves, we give new upper bounds for compactly supported Betti numbers for arbitrary affine varieties in $\mathbb{A}^n$ defined by $r$ polynomial equations of degrees at most $d$. As arithmetic applications, new total degree bounds are obtained for zeta functions of varieties and L-functions of exponential sums over finite fields, improving the classical results of Bombieri, Katz, and Adolphson--Sperber. In the complete intersection case, our total Betti number bound is asymptotically optimal as a function in $d$. In general, it remains an open problem to find an asymptotically optimal bound as a function in $d$.
Using $\ell$-adic cohomology of tensor inductions of lisse $\overline{\mathbb Q}_\ell$-sheaves, we study a class of incomplete character sums.
Let $B$ be a product of finitely many finite fields containing $\mathbb F_q$, $ψ:\mathbb F_q\to \overline{\mathbb Q}_\ell^*$ a nontrivial additive character, and $χ: B^*\to \overline{\mathbb Q}_\ell^*$ a multiplicative character. Katz introduced the so-called exotic inverted Kloosterman sum \begin{eqnarray*} \mathrm{EIK}(\mathbb F_q, a):=\sum_{\substack{x\in B^* \\ \mathrm{Tr}_{B/\mathbb F_q}(x)\not =0\\ \mathrm{N}_{B/\mathbb F_q}(x)=a}} χ(x)ψ\Big(\frac{1}{\mathrm{Tr}_{B/\mathbb F_q}(x)}\Big), \ \ a\in \mathbb F_q^*. \end{eqnarray*} We estimate this sum using $\ell$-adic cohomology theory. Our main result is that, up to a trivial term, the associated exotic inverted Kloosterman sheaf is lisse of rank at most $2(n+1)$ and mixed of weight at most $n$, where $n+1 = \dim_{\mathbb F_q}B$. Up to a trivial main term, this gives the expected square root cancellation.
We study Frobenius eigenvalues of the compactly supported rigid cohomology of a variety defined over a finite field of $q$ elements via Dwork's method. A couple of arithmetic consequences will be drawn from this study. As the first application, we show that the zeta functions for finitely many related affine varieties are capable of witnessing all Frobenius eigenvalues of the rigid cohomology of the variety up to Tate twist. This result does not seem to be known for $\ell$-adic cohomology. As the second application, we prove several $q$-divisibility lower bounds for Frobenius eigenvalues of the rigid cohomology of the variety in terms of the multi-degrees of the defining equations. These divisibility bounds for rigid cohomology are generally better than what is suggested from the best known divisibility bounds in $\ell$-adic cohomology, both before and after the middle cohomological dimension.
The study of $n$-dimensional inverted Kloosterman sums was suggested by Katz (1995) who handled the case when $n=1$ from complex point of view. For general $n\geq 1$, the $n$-dimensional inverted Kloosterman sums were studied from both complex and $p$-adic point of view in our previous paper. In this note, we study the algebraic degree of the inverted $n$-dimensional Kloosterman sum as an algebraic integer.
The classical $n$-variable Kloosterman sums over finite fields are well understood by Deligne's theorem from complex point of view and by Sperber's theorem from $p$-adic point of view. In this paper, we study the complex and $p$-adic estimates of inverted $n$-variable Kloosterman sums, addressing a question of N. Katz (1995). We shall give two complex estimates. The first one is elementary based on Gauss sums. The second estimate is deeper, depending on the cohomological results of Adolphson-Sperber, Denef-Loeser and Fu for twisted toric exponential sums. This deeper result assumes that the characteristic $p$ does not divide $n+1$. Combining with Dwork's $p$-adic theory, we also determine the exact $p$-adic valuations for zeros and poles of the L-function associated to inverted $n$-variable Kloosterman sums in the case $p \equiv 1 \mod (n+1)$. As we shall see, the inverted $n$-variable Kloosterman sum is more complicated than the classical $n$-variable Kloosterman sum in all aspects in the sense that our understanding is less complete, partly because the Hodge numbers are now mostly $2$ instead of $1$.
Let $\mathbb{F}_q$ denote the finite field of $q$ elements with characteristic $p$. Let $\mathbb{Z}_q$ denote the unramified extension of the $p$-adic integers $\mathbb{Z}_p$ with residue field $\mathbb{F}_q$. In this paper, we investigate the $q$-divisibility for the number of solutions of a polynomial system in $n$ variables over the finite Witt ring $\mathbb{Z}_q/p^m\mathbb{Z}_q$, where the $n$ variables of the polynomials are restricted to run through a combinatorial box lifting $\mathbb{F}_q^n$. The introduction of the combinatorial box makes the problem much more complicated. We prove a $q$-divisibility theorem for any box of low algebraic complexity, including the simplest Teichmüller box.This extends the classical Ax-Katz theorem over finite field $\mathbb{F}_q$ (the case $m=1$). Taking $q=p$ to be a prime, our result extends and improves a recent combinatorial theorem of Grynkiewicz. Our different approach is based on the addition operation of Witt vectors and is conceptually much more transparent.
To a torus action on a complex vector space, Gelfand, Kapranov and Zelevinsky introduce a system of differential equations, which are now called the GKZ hypergeometric system. Its solutions are GKZ hypergeometric functions. We study the $p$-adic counterpart of the GKZ hypergeometric system. The $p$-adic GKZ hypergeometric complex is a twisted relative de Rham complex of over-convergent differential forms with logarithmic poles. It is an over-holonomic object in the derived category of arithmetic $\mathcal D$-modules with Frobenius structures. Traces of Frobenius on fibers at Techmüller points of the GKZ hypergeometric complex define the hypergeometric function over the finite field introduced by Gelfand and Graev. Over the non-degenerate locus, the GKZ hypergeometric complex defines an over-convergent $F$-isocrystal. It is the crystalline companion of the $\ell$-adic GKZ hypergeometric sheaf that we constructed before. Our method is a combination of Dwork's theory and the theory of arithmetic $\mathcal D$-modules of Berthelot.
v2: For a projective variety defined over a finite field with $q$ elements, it is shown that as algebraic integers, the eigenvalues of the geometric Frobenius acting on $\ell$-adic cohomology have higher than known $q$-divisibility beyond the middle dimension. This sharpens both Deligne's integrality theorem and the cohomological divisibility theorem proven by the first author and N. Katz. Similar lower bounds are proved for the Hodge level for a complex variety beyond the middle dimension, improving earlier results in this direction. We discuss the affine case. The previous version contained a gap at this place. We are thankful to Dingxin Zhang for noticing it.
We give a method to construct deep holes for elliptic curve codes. For long elliptic curve codes, we conjecture that our construction is complete in the sense that it gives all deep holes. Some evidence and heuristics on the completeness are provided via the connection with problems and results in finite geometry.
The degree sequence of the algebraic numbers in an algebraic linear recurrence sequence is shown to be virtually periodic. This is proved using the Skolem-Mahler-Lech theorem. It has applications to the degree sequence and the minimal polynomial sequence for exponential sums over finite fields. The degree periodicity also holds for some more complicated non-linear recurrence sequences. We give one example from the iterations of a polynomial map. This depending on the dynamic Mordell-Lang conjecture which has been proved in some cases.
In this paper, we improve the algorithms of Lauder-Wan \cite{LW} and Harvey \cite{Ha} to compute the zeta function of a system of $m$ polynomial equations in $n$ variables over the finite field $\FF_q$ of $q$ elements, for $m$ large. The dependence on $m$ in the original algorithms was exponential in $m$. Our main result is a reduction of the exponential dependence on $m$ to a polynomial dependence on $m$. As an application, we speed up a doubly exponential time algorithm from a software verification paper \cite{BJK} (on universal equivalence of programs over finite fields) to singly exponential time. One key new ingredient is an effective version of the classical Kronecker theorem which (set-theoretically) reduces the number of defining equations for a "large" polynomial system over $\FF_q$ when $q$ is suitably large.