arXiv subjects
Publications and source records attributed to Daqing Wan.
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.
For any affine hypersurface defined by a complete symmetric polynomial in $k\geq 3$ variables of degree $m$ over the finite field $\mathbb{F}_{q}$ of $q$ elements, a special case of our theorem says that this hypersurface has at least $6q^{k-3}$ rational points over $\mathbb{F}_{q}$ if $1\leq m \leq q-3$ and $q$ is odd. A key ingredient in our proof is Segre's classical theorem on ovals in finite projective planes.
We deduce Katz's theorems for $(A,B)$-exponential sums over finite fields using $\ell$-adic cohomology and a theorem of Denef-Loeser, removing the hypothesis that $A+B$ is relatively prime to the characteristic $p$. In some degenerate cases, the Betti number estimate is improved using toric decomposition and Adolphson-Sperber's bound for the degree of $L$-functions. Applying the facial decomposition theorem in \cite{W1}, we prove that the universal family of $(A,B)$-polynomials is generically ordinary for its $L$-function when $p$ is in certain arithmetic progression.
In these notes, we explore possible stable properties for the zeta function of a geometric Zp-tower of curves over a finite field of characteristic p, in the spirit of Iwasawa theory. A number of fundamental questions and conjectures are proposed for those Zp towers coming from algebraic geometry.
The $k$-subset sum problem over finite fields is a classical NP-complete problem.Motivated by coding theory applications, a more complex problem is the higher $m$-th moment $k$-subset sum problem over finite fields. We show that there is a deterministic polynomial time algorithm for the $m$-th moment $k$-subset sum problem over finite fields for each fixed $m$ when the evaluation set is the image set of a monomial or Dickson polynomial of any degree $n$. In the classical case $m=1$, this recovers previous findings.
Projective Reed-Solomon (PRS) codes are Reed-Solomon codes of the maximum possible length q+1. The classification of deep holes --received words with maximum possible error distance-- for PRS codes is an important and difficult problem. In this paper, we use algebraic methods to explicitly construct three classes of deep holes for PRS codes. We show that these three classes completely classify all deep holes of PRS codes with redundancy at most four. Previously, the deep hole classification was only known for PRS codes with redundancy at most three in work arXiv:1612.05447
Let $\mathbb{F}_q$ be the finite field of $q$ elements. In this paper we obtain bounds on the following counting problem: given a polynomial $f(x)\in \mathbb{F}_q[x]$ of degree $k+m$ and a non-negative integer $r$, count the number of polynomials $g(x)\in \mathbb{F}_q[x]$ of degree at most $k-1$ such that $f(x)+g(x)$ has exactly $r$ roots in $\mathbb{F}_q$. Previously, explicit formulas were known only for the cases $m=0, 1, 2$. As an application, we obtain an asymptotic formula on the list size of the standard Reed-Solomon code $[q, k, q-k+1]_q$.
In this paper, we determine the covering radius and a class of deep holes for Gabidulin codes with both rank metric and Hamming metric. Moreover, we give a necessary and sufficient condition for deciding whether a word is not a deep hole for Gabidulin codes, by which we study the error distance of a special class of words to certain Gabidulin codes.
To extend Iwasawa's classical theorem from ${\mathbb Z}_p$-towers to ${\mathbb Z}_p^d$-towers, Greenberg conjectured that the exponent of $p$ in the $n$-th class number in a ${\mathbb Z}_p^d$-tower of a global field $K$ ramified at finitely many primes is given by a polynomial in $p^n$ and $n$ of total degree at most $d$ for sufficiently large $n$. This conjecture remains open for $d\geq 2$. In this paper, we prove that this conjecture is true in the function field case. Further, we propose a series of general conjectures on $p$-adic stability of zeta functions in a $p$-adic Lie tower of function fields.
In this paper, deep holes of Reed-Solomon (RS) codes are studied. A new class of deep holes for generalized affine RS codes is given if the evaluation set satisfies certain combinatorial structure. Three classes of deep holes for projective Reed-Solomon (PRS) codes are constructed explicitly. In particular, deep holes of PRS codes with redundancy three are completely obtained when the characteristic of the finite field is odd. Most (asymptotically of ratio $1$) of the deep holes of PRS codes with redundancy four are also obtained.
Suppose $p$ is a prime, $t$ is a positive integer, and $f\!\in\!\mathbb{Z}[x]$ is a univariate polynomial of degree $d$ with coefficients of absolute value $<\!p^t$. We show that for any fixed $t$, we can compute the number of roots in $\mathbb{Z}/(p^t)$ of $f$ in deterministic time $(d+\log p)^{O(1)}$. This fixed parameter tractability appears to be new for $t\!\geq\!3$. A consequence for arithmetic geometry is that we can efficiently compute Igusa zeta functions $Z$, for univariate polynomials, assuming the degree of $Z$ is fixed.
Let $K$ be a function field over a finite field $k$ of characteristic $p$ and let $K_{\infty}/K$ be a geometric extension with Galois group $\mathbb{Z}_p$. Let $K_n$ be the corresponding subextension with Galois group $\mathbb{Z}/p^n\mathbb{Z}$ and genus $g_n$. In this paper, we give a simple explicit formula $g_n$ in terms of an explicit Witt vector construction of the $\mathbb{Z}_p$-tower. This formula leads to a tight lower bound on $g_n$ which is quadratic in $p^n$. Furthermore, we determine all $\mathbb{Z}_p$-towers for which the genus sequence is stable, in the sense that there are $a,b,c \in \mathbb{Q}$ such that $g_n=a p^{2n}+b p^n +c$ for $n$ large enough. Such genus stable towers are expected to have strong stable arithmetic properties for their zeta functions. A key technical contribution of this work is a new simplified formula for the Schmid-Witt symbol coming from local class field theory.
For a global function field K of positive characteristic p, we show that Artin conjecture for L-functions of geometric p-adic Galois representations of K is true in a non-trivial p-adic disk but is false in the full p-adic plane. In particular, we prove the non-rationality of the geometric unit root L-functions.
In this paper we introduce a new infinite class of bipartite graphs, called jumped Wenger graphs, which are closely related to Wenger graphs. An tight upper bound of the diameter and the exact girth of a jumped Wenger graph $J_m(q, i, j )$ for integers $i, j$, $1\leq i <j \leq m+2$, are determined. In particular, the exact diameter of the jumped Wenger graph $J_m(q, i, j)$ if $(i, j)=(m,m+2), (m+1,m+2)$ or $(m,m+1)$ is also obtained.
We fix a monic polynomial $\bar f(x) \in \mathbb{F}_q[x]$ over a finite field of characteristic $p$, and consider the $\mathbb{Z}_{p^{\ell}}$-Artin-Schreier-Witt tower defined by $\bar f(x)$; this is a tower of curves $\cdots \to C_m \to C_{m-1} \to \cdots \to C_0 =\mathbb{A}^1$, whose Galois group is canonically isomorphic to $\mathbb{Z}_{p^\ell}$, the degree $\ell$ unramified extension of $\mathbb{Z}_p$, which is abstractly isomorphic to $(\mathbb{Z}_p)^\ell$ as a topological group. We study the Newton slopes of zeta functions of this tower of curves. This reduces to the study of the Newton slopes of L-functions associated to characters of the Galois group of this tower. We prove that, when the conductor of the character is large enough, the Newton slopes of the L-function asymptotically form a finite union of arithmetic progressions. As a corollary, we prove the spectral halo property of the spectral variety associated to the $\mathbb{Z}_{p^{\ell}}$-Artin-Schreier-Witt tower. This extends the main result in [DWX] from rank one case $\ell=1$ to the higher rank case $\ell\geq 1$.
We prove that the eigencurve associated to a definite quaternion algebra over $\QQ$ satisfies the following properties, as conjectured by Coleman--Mazur and Buzzard--Kilford: (a) over the boundary annuli of weight space, the eigencurve is a disjoint union of (countably) infinitely many connected components each finite and flat over the weight annuli, (b) the $U_p$-slopes of points on each fixed connected component are proportional to the $p$-adic valuations of the parameter on weight space, and (c) the sequence of the slope ratios form a union of finitely many arithmetic progressions with the same common difference. In particular, as a point moves towards the boundary on an irreducible connected component of the eigencurve, the slope converges to zero.