Jonathan Pila
This note concerns the theoretical algorithmic problem of counting rational points on curves over finite fields. It explicates how the algorithmic scheme introduced by Schoof and generalized by the author yields an algorithm whose running time is uniformly polynomial time for curves in families.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Let E_G be a family of hyperelliptic curves over F2^(alg cl) with general Weierstrass equation given over a very small field F. We describe in this paper an algorithm to compute the zeta function of E_g for g in a degree n extension field of F, which has as time complexity O(n^3) and memory requirements O(n^2). With a slightly different algorithm we can get time O(n^2,667) and memory O(n^2,5), and the computation of O(n) curves of the family can be done in time and space O(n^3). All these algorithms are polynomial in the genus.
Let E_G be a family of hyperelliptic curves defined by Y^2=Q(X,G), where Q is defined over a small finite field of odd characteristic. Then with g in an extension degree n field over this small field, we present a deterministic algorithm for computing the zeta function of the curve E_g by using Dwork deformation in rigid cohomology. The time complexity of the algorithm is O(n^(2.667)) and it needs O(n^(2.5)) bits of memory. A slight adaptation requires only O(n^2) space, but costs time O(n^3). An implementation of this last result turns out to be quite efficient for n big enough.
We give an asymptotic formula for the number of elliptic curves over $\mathbb{Q}$ with bounded Faltings height. Silverman has shown that the Faltings height for elliptic curves over number fields can be expressed in terms of modular functions and the minimal discriminant of the elliptic curve. We use this to recast the problem as one of counting lattice points in a particular region in $\mathbb{R}^2$.
We introduce a new algorithm to compute the zeta function of a curve over a finite field. This method extends previous work of ours to all curves for which a good lift to characteristic zero is known. We develop all the necessary bounds, analyse the complexity of the algorithm and provide a complete implementation.
We introduce a new algorithm to compute the zeta function of a curve over a finite field. This method extends Kedlaya's algorithm to a very general class of curves using a map to the projective line. We develop all the necessary bounds, analyse the complexity of the algorithm and provide some examples computed with our implementation.
Motivic counting of curves on split quintic del Pezzo surfaces
本文证明了分裂五次德尔皮佐表面的Batyrev-Manin-Peyre猜想的'所有高度'版本，涵盖了正特征全局函数域上的有理点计数及一般基域上的动机版本。
For a given conic bundle X over a curve C defined over F_q, we count irreducible branch covers of C in X of degree d and height e>>1. As a special case, we get the number of algebraic numbers of degree d and height e over the function field F_q (C).
We describe an algorithm for counting points on an arbitrary hyperelliptic curve over a finite field of odd characteristic, using Monsky-Washnitzer cohomology to compute a p-adic approximation to the characteristic polynomial of Frobenius. For fixed p, the asymptotic running time for a curve of genus g over the field of p^n elements is O(g^{4+ε} n^{3+ε}).
We study the problem of lifting curves from finite fields to number fields in a genus and gonality preserving way. More precisely, we sketch how this can be done efficiently for curves of gonality at most four, with an in-depth treatment of curves of genus at most five over finite fields of odd characteristic, including an implementation in Magma. We then use such a lift as input to an algorithm due to the second author for computing zeta functions of curves over finite fields using $p$-adic cohomology.
We find a closed formula for the number $\operatorname{hyp}(g)$ of hyperelliptic curves of genus $g$ over a finite field $k=\mathbb{F}_q$ of odd characteristic. These numbers $\operatorname{hyp}(g)$ are expressed as a polynomial in $q$ with integer coefficients that depend on the set of divisors of $q-1$ and $q+1$. As a by-product we obtain a closed formula for the number of self-dual curves of genus $g$. A hyperelliptic curve is self-dual if it is $k$-isomorphic to its own hyperelliptic twist.
We present a deterministic algorithm that computes the zeta function of a nonsupersingular elliptic curve E over a finite field with p^n elements in time quasi-quadratic in n. An older algorithm having the same time complexity uses the canonical lift of E, whereas our algorithm uses rigid cohomology combined with a deformation approach. An implementation in small odd characteristic turns out to give very good results.
Mazur's theorem states that there are exactly 15 possibilities for the torsion subgroup of an elliptic curve over the rational numbers. We determine how often each of these groups actually occurs. Precisely, if $G$ is one of these 15 groups, we show that the number of elliptic curves up to height $X$ whose torsion subgroup is isomorphic to $G$ is on the order of $X^{1/d}$, for some number $d=d(G)$ which we compute.
We count the number of rational elliptic curves of bounded naive height that have a rational $N$-isogeny, for $N \in \{2,3,4,5,6,8,9,12,16,18\}$. For some $N$, this is done by generalizing a method of Harron and Snowden. For the remaining cases, we use the framework of Ellenberg, Satriano and Zureick-Brown, in which the naive height of an elliptic curve is the height of the corresponding point on a moduli stack.
We use a global version of Heath-Brown's $p-$adic determinant method developed by Salberger to give upper bounds for the number of rational points of height at most $B$ on non-singular cubic curves defined over $\mathbb{Q}$. The bounds are uniform in the sense that they only depend on the rank of the corresponding Jacobian.
A superspecial curve is a (non-singular) curve over a field of positive characteristic whose Jacobian variety is isomorphic to a product of supersingular elliptic curves over the algebraic closure. It is known that for given genus and characteristic, there exist only finitely many superspecial curves, up to isomorphism over an algebraically closed field. In this article, we give a brief survey on results of counting isomorphism classes of superspecial curves. In particular, this article summarizes some recent results in the case of genera four and five, obtained by the author and S.\ Harashita…
We describe an algorithm to compute the zeta-function of a proper, smooth curve over a finite field, when the curve is given together with some auxiliary data. Our method is based on computing the matrix of the action of a semi-linear Frobenius on the first cohomology group of the curve by means of Serre duality. The cup product involved can be computed locally, after first computing local expansions of a globally defined lift of Frobenius. The resulting algorithm's complexity is softly cubic in the field degree, which is also the case with Kedlaya's algorithm in the hyperelliptic case.
Suppose X is a (smooth projective irreducible algebraic) curve over a finite field k. Counting the number of points on X over all finite field extensions of k will not determine the curve uniquely. Actually, a famous theorem of Tate implies that two such curves over k have the same zeta function (i.e., the same number of points over all extensions of k) if and only if their corresponding Jacobians are isogenous. We remedy this situation by showing that if, instead of just the zeta function, all Dirichlet L-series of the two curves are equal via an isomorphism of their Dirichlet character group…
In this article we give the details of an effective point counting algorithm for genus two curves over finite fields of characteristic three. The algorithm has an application in the context of curve based cryptography. One distinguished property of the algorithm is that its complexity depends quasi-quadratically on the degree of the finite base field. Our algorithm is a modified version of an earlier method that was developed in joint work with Lubicz. We explain how one can alter the original algorithm, on the basis of new theory, such that it can be used to efficiently count points on genus …
Motivic counting of rational curves with tangency conditions via universal torsors
本文借助 Cox 环与泛 torsor 分解曲线到 Mori Dream Space 的态射模空间动机，并在环面簇情形证明满足边界相切条件的 Campana 曲线的动机版 Batyrev–Manin–Peyre 原理。
In this paper we prove that complete families of smooth and projective curves, of genusg>2, in characteristic p>0, with a constant geometric fundamental group, are isotrivial.
We consider algebraic affine and projective curves of Edwards \cite{E, SkOdProj} over a finite field $\text{F}_{p^n}$. Most cryptosystems of the modern cryptography \cite{SkBlock} can be naturally transform into elliptic curves \cite{Kob}. We research Edwards algebraic curves over a finite field, which at the present time is one of the most promising supports of sets of points that are used for fast group operations \cite{Bir}. New method of counting Edwards curve order over finite field was constructed. It can be applied to order of elliptic curve due to birational equivalence between ellipti…
This paper is a follow up of arXiv:1702.02255 [math.NT]. We construct explicitly versal families of elliptic curves with rational points of order 4, 6, 8, 10, 12 respectively.
We count by height the number of elliptic curves over the rationals that possess an isogeny of degree three.
Let k be a finite field of odd characteristic. We find a closed formula for the number of k-isomorphism classes of pointed, and non-pointed, hyperelliptic curves of genus g over k, admitting a Koblitz model. These numbers are expressed as a polynomial in the cardinality q of k, with integer coefficients (for pointed curves) and rational coefficients (for non-pointed curves). The coefficients depend on g and the set of divisors of q-1 and q+1. These formulas show that the number of hyperelliptic curves of genus g suitable (in principle) of cryptographic applications is asymptotically (1-e^{-1})…
In recent algorithms that use deformation in order to compute the number of points on varieties over a finite field, certain differential equations of matrices over p-adic fields emerge. We present a novel strategy to solve this kind of equations in a memory efficient way. The main application is an algorithm requiring quasi-cubic time and only quadratic memory in the parameter n, that solves the following problem: for E a hyperelliptic curve of genus g over a finite field of extension degree n and small characteristic, compute its zeta function. This improves substantially upon Kedlaya's resu…
In this paper, we study the distribution of integral points on parametric families of affine homogeneous varieties. By the work of Borel and Harish-Chandra, the set of integral points on each such variety consists of finitely many orbits of arithmetic groups, and we establish an asymptotic formula (on average) for the number of the orbits indexed by their Siegel weights. In particular, we deduce asymptotic formulas for the number of inequivalent integral representations by decomposable forms and by norm forms in division algebras, and for the weighted number of equivalence classes of integral …
Counting rational points in non-singular curves
本文应用全局行列式法，给出了非奇异曲线中高度有界的有理点数量的统一上界。
Counting points on some genus zero Shimura curves
本文利用零维 Shimura 曲线上有界高度点的计数，研究数域 $K$ 上具潜在四元数乘法的阿贝尔曲面数量。
We prove upper bounds for the number of rational points on non-singular cubic curves defined over the rationals. The bounds are uniform in the curve and involve the rank of the corresponding Jacobian. The method used in the proof is a combination of the "determinant method" with an m-descent on the curve.
We give explicit formulas for the number of points on reductions of elliptic curves with complex multiplication by any imaginary quadratic field. We also find models for CM $\mathbf{Q}$-curves in certain cases. This generalizes earlier results of Gross, Stark, and others.
Counting elliptic curves over the rationals with a 7-isogeny
本文按高度计数了有理数域上具有7次循环同源的椭圆曲线数量，分别考虑了有理数域及其代数闭包上的同构类。
We present an accelerated Schoof-type point-counting algorithm for curves of genus 2 equipped with an efficiently computable real multiplication endomorphism. Our new algorithm reduces the complexity of genus 2 point counting over a finite field (\F_{q}) of large characteristic from (\widetilde{O}(\log^8 q)) to (\widetilde{O}(\log^5 q)). Using our algorithm we compute a 256-bit prime-order Jacobian, suitable for cryptographic applications, and also the order of a 1024-bit Jacobian.
We give mean square bounds for the remainder in the lattice point counting problem, counting the number of lattice points in a large ball in $\mathbb{R}^d$, when averaged over families of shears of the lattice.
Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and let $N$ be a positive integer. Now, $M_E(N)$ counts the number of primes $p$ such that the group $E_p(\mathbb{F}_p)$ is of order $N$. In an earlier joint work with Balasubramanian, we showed that $M_E(N)$ follows Poisson distribution when an average is taken over a family of elliptic curve with parameters $A$ and $B$ where $A,\, B\ge N^{\frac{\ell}{2}}(\log N)^{1+γ}$ and $AB>N^{\frac{3\ell}{2}}(\log N)^{2+γ}$ for a fixed integer $\ell$ and any $γ>0$. In this paper, we show that for sufficiently large $N$, the same result holds even if …
In this paper, we present efficient algorithms for computing the number of points and the order of the Jacobian group of a superelliptic curve over finite fields of prime order p. Our method employs the Hasse-Weil bounds in conjunction with the Hasse-Witt matrix for superelliptic curves, whose entries we express in terms of multinomial coefficients. We present a fast algorithm for counting points on specific trinomial superelliptic curves and a slower, more general method for all superelliptic curves. For the first case, we reduce the problem of simplifying the entries of the Hasse-Witt matrix…
Let $E$ be an elliptic curve defined over rational field $\mathbb{Q}$ and $N$ be a positive integer. Now, $M_E(N)$ denotes the number of primes $p$, such that the group $E_p(\mathbb{F}_p)$ is of order $N$. We show that $M_E(N)$ follows Poisson distribution when an average is taken over a large class of curves.
We find an asymptotic formula for the number of rational points near planar curves. More precisely, if $f:\mathbb{R}\rightarrow\mathbb{R}$ is a sufficiently smooth function defined on the interval $[η,ξ]$, then the number of rational points with denominator no larger than $Q$ that lie within a $δ$-neighborhood of the graph of $f$ is shown to be asymptotically equivalent to $(ξ-η)δQ^2$.
Counting odd genus $2$ curves with a marked rational $3$-torsion point
研究有理数域上特定条件的亏格2曲线，通过朴素高度排序计数，核心方法是基于曲线的首一魏尔斯特拉斯模型及雅可比行列式的有理3 - 挠点条件。
We present a probabilistic Las Vegas algorithm for computing the local zeta function of a hyperelliptic curve of genus $g$ defined over $\mathbb{F}_q$. It is based on the approaches by Schoof and Pila combined with a modeling of the $\ell$-torsion by structured polynomial systems. Our main result improves on previously known complexity bounds by showing that there exists a constant $c>0$ such that, for any fixed $g$, this algorithm has expected time and space complexity $O((\log q)^{cg})$ as $q$ grows and the characteristic is large enough.
In this work, we investigate hyperelliptic curves of type $C: y^2 = x^{2g+1} + ax^{g+1} + bx$ over the finite field $\mathbb{F}_q, q = p^n, p > 2$. For the case of $g = 3$ and $4$ we propose algorithms to compute the number of points on the Jacobian of the curve with complexity $\tilde{O}(\log^4{p})$ and $\tilde{O}(\log^8{p})$. For curves of genus $2-7$ we give a complete list of the characteristic polynomials of Frobenius endomorphism modulo $p$.
Secondary terms in the counting functions of quartic fields
本文证明了满足有限局部条件的四次域平滑计数函数可表示为特定线性组合并确定次要项前导常数，且用次要质量公式表达这些常数。
Schoof's classic algorithm allows point-counting for elliptic curves over finite fields in polynomial time. This algorithm was subsequently improved by Atkin, using factorizations of modular polynomials, and by Elkies, using a theory of explicit isogenies. Moving to Jacobians of genus-2 curves, the current state of the art for point counting is a generalization of Schoof's algorithm. While we are currently missing the tools we need to generalize Elkies' methods to genus 2, recently Martindale and Milio have computed analogues of modular polynomials for genus-2 curves whose Jacobians have real …
In this paper we address two different problems related with the factorization of an RSA module N. First we can show that factoring is equivalent in deterministic polynomial time to counting points on a pair of twisted Elliptic curves modulo N. Also we settle the malleability of factoring an RSA module, as described in [9], using the number of points of a single elliptic curve modulo N, and Coppersmith's algorithm.
We describe iterated integrals as unipotent periods on families of marked elliptic curves in terms of multiple zeta values and elliptic multiple zeta values.
We produce a collection of families of curves, whose point count statistics over F_p becomes Gaussian for p fixed. In particular, the average number of F_p points on curves in these families tends to infinity.
There are several formulas for the number of orbits of the projective line under the action of subgroups of $GL_2$. We give an interpretation of two such formulas in terms of the geometry of elliptic curves, and prove a more general formula for a large class of congruence subgroups of Bianchi groups. Our formula involves the number of walks on a certain graph called an isogeny volcano. Underlying our results is a complete description of the group of extensions of a pair of CM elliptic curves, and of a pair of lattices in a quadratic field.
We describe a simple, but effective, method for deriving families of elliptic curves, with high rank, all of whose members have the same torsion subgroup structure.
We compute equations for the families of elliptic curves 9-congruent to a given elliptic curve. We use these to find infinitely many non-trivial pairs of 9-congruent elliptic curves over Q, i.e. pairs of non-isogenous elliptic curves over Q whose 9-torsion subgroups are isomorphic as Galois modules.
We obtain new results concerning the Sato--Tate conjecture on the distribution of Frobenius angles over parametric families of elliptic curves with a rational parameter of bounded height.
Let $E/\mathbb{Q}$ be an elliptic curve over the rational numbers. It is known, by the work of Bombieri and Zannier, that if $E$ has full rational $2$-torsion, the number $N_E(B)$ of rational points with Weil height bounded by $B$ is $\exp\left(O\left(\frac{\log B}{\sqrt{\log\log B}}\right)\right)$. In this paper we exploit the method of descent via $2$-isogeny to extend this result to elliptic curves with just one nontrivial rational $2$-torsion point. Moreover, we make use of a result of Petsche to derive the stronger upper bound $N_{E}(B) = \exp\left(O\left(\frac{\log B}{\log\log B}\right)\…
We show that the unboundedness of the ranks of the quadratic twists of an elliptic curve is equivalent to the divergence of certain infinite series.
Counting algebraic points of bounded degree on curves
本文研究数域上光滑射影曲线中满足次数为ν、函数域与基域经gonality态射一致且高度不超过T的代数点数量的增长速率。
Counting rational points on transcendental curves in valued fields
本文在任意1-h-极小域中建立超越曲线上有理点数的上界，将Pila–Wilkie型计数定理从p-进域推广到混合特征赋值域，方法上避免r次幂映射并采用参数化与行列式方法。
We obtain new results concerning the Sato-Tate conjecture on the distribution of Frobenius traces over single and double parametric families of elliptic curves. We consider these curves for values of parameters having prescribed arithmetic structure: product sets, geometric progressions, and most significantly prime numbers. In particular, some families are much thinner than the ones previously studied.
Let $k=2^mp^n$ for an odd prime $p$ and integers $m\ge 0$ and $n\ge 0$. We obtain lower bounds for the $ρ$-values of cyclotomic families of pairing-friendly elliptic curves with embedding degree $k$ and $r(x)=Φ_k(x)$. Our bounds imply that none of these families are ideal.
While there has been considerable interest in the problem of finding elliptic curves of high rank over $\mathbb{Q}$, very few parametrized families of elliptic curves of generic rank $\geq 8$ have been published. In this paper we use solutions of certain symmetric diophantine systems to construct several parametrized families of elliptic curves with their generic ranks ranging from at least 8 to at least 12. Specific numerical values of the parameters yield elliptic curves with quite large coefficients and we could therefore determine the precise rank only in a few cases where the rank of the …
In this expository paper we show how one can, in a uniform way, calculate the weight distributions of some well-known binary cyclic codes. The codes are related to certain families of curves, and the weight distributions are related to the distribution of the number of rational points on the curves.
Counting integral points near curves: an exposition
该研究针对n≥4的情况，改进了Hickman与Srivastava关于n维欧氏空间中光滑非退化曲线邻域内整点计数的上下界，所得界为特定条件下目前最优。
Counting integral points near space curves: a Fourier analytic approach
本文利用傅里叶分析方法（特别是 Arkhipov--Chubarikov--Karatsuba 型振荡积分估计），建立了 $\mathbb{R}^n$（$n\geq 3$）中光滑非退化曲线邻域内整点数量的上下界，不依赖平面曲线的精确计数结果，并恢复了 $n=3$ 时的已知结论。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。