English
Related papers

Related papers: A p-adic quasi-quadratic point counting algorithm

200 papers

In this paper we produce a generating function for the number of hyperelliptic curves (up to translation) on a polarized Abelian surfaces using the crepant resolution conjecture and the Yau-Zaslow formula. We present a formula to compute…

Algebraic Geometry · Mathematics 2012-04-18 Simon Rose

We outline an algorithm for the Quantum Counting problem using Adiabatic Quantum Computation (AQC). We show that using local adiabatic evolution, a process in which the adiabatic procedure is performed at a variable rate, the problem is…

Quantum Physics · Physics 2014-06-02 Itay Hen

We describe an algorithm that determines a set of unramified covers of a given hyperelliptic curve, with the property that any rational point will lift to one of the covers. In particular, if the algorithm returns an empty set, then the…

Number Theory · Mathematics 2009-07-02 Nils Bruin , Michael Stoll

We describe an algorithm that provably computes the rational torsion subgroup of the Jacobian of a curve without relying on height bounds. Instead, the strategy is to find upper bounds for the torsion subgroup using reduction modulo primes,…

Number Theory · Mathematics 2026-05-05 Raymond van Bommel

Denote by $J_m$ the Jacobian variety of the hyperelliptic curve defined by the affine equation $y^2=x^m+1$ over $\mathbb{Q}$, where $m \geq 3$ is a fixed positive integer. In this paper, we compute the Sato-Tate group of $J_m$. Currently,…

Number Theory · Mathematics 2025-07-04 Andrea Gallese , Heidi Goodson , Davide Lombardo

An asymptotic formula is established for the number of rational points of bounded anticanonical height which lie on a certain Zariski open subset of an arbitrary smooth biquadratic hypersurface in sufficiently many variables. The proof uses…

Number Theory · Mathematics 2018-10-22 T. D. Browning , L. Q. Hu

Bruin and Najman, Ozman and Siksek, and Box described all the quadratic points on the modular curves of genus $2\leq g(X_0(n)) \leq 5$. Since all the hyperelliptic curves $X_0(n)$ are of genus $\leq 5$ and as a curve can have infinitely…

Number Theory · Mathematics 2022-11-01 Filip Najman , Borna Vukorepa

Given a principally polarized abelian variety $A$ of dimension $g$ over an algebraically closed field $k$ of characteristic $p$, the $p$ torsion $A[p]$ is a finite flat $p$-torsion group scheme of rank $p^{2g}$. There are exactly $2^g$…

Algebraic Geometry · Mathematics 2017-12-14 Sanath Devalapurkar , John Halliday

We discuss a new method to compute the canonical height of an algebraic point on a hyperelliptic jacobian over a number field. The method does not require any geometrical models, neither $p$-adic nor complex analytic ones. In the case of…

Number Theory · Mathematics 2019-02-20 Robin de Jong , J. Steffen Müller

This paper examines the arithmetic of the loci \(\cL_n\), parameterizing genus 2 curves with \((n, n)\)-split Jacobians over finite fields \(\F_q\). We compute rational points \(|\cL_n(\F_q)|\) over \(\F_3\), \(\F_9\), \(\F_{27}\),…

Number Theory · Mathematics 2025-11-18 Elira Shaska , Jorge Mello , Sajad Salami , Tony Shaska

In 2005, Kayal suggested that Schoof's algorithm for counting points on elliptic curves over finite fields might yield an approach to factor polynomials over finite fields in deterministic polynomial time. We present an exposition of his…

Number Theory · Mathematics 2017-10-04 Bjorn Poonen

The number A(q) shows the asymptotic behaviour of the quotient of the number of rational points over the genus of non-singular absolutely irreducible curves over a finite field Fq. Research on bounds for A(q) is closely connected with the…

Algebraic Geometry · Mathematics 2007-07-16 J. I. Farran

Using quantum algorithms, we obtain, for accuracy $\epsilon>0$ and confidence $1-\delta,0<\delta<1,$ a new sample complexity upper bound of $O((\mbox{log}(\frac{1}{\delta}))/\epsilon)$ as $\epsilon,\delta\rightarrow 0$ for a general…

Quantum Physics · Physics 2024-04-22 Daniel Z. Zanger

We give a brief report on our computations of linear determinantal representations of smooth plane cubics over finite fields. After recalling a classical interpretation of linear determinantal representations as rational points on the…

Number Theory · Mathematics 2016-05-24 Yasuhiro Ishitsuka

We study the intersection of two particular Fermat hypersurfaces in $\mathbb{P}^3$ over a finite field. Using the Kani-Rosen decomposition we study arithmetic properties of this curve in terms of its quotients. Explicit computation of the…

Algebraic Geometry · Mathematics 2010-11-25 Vijaykumar Singh , Gary McGuire

This paper is concerned with some Algebraic Geometry codes on Jacobians of genus 2 curves. We derive a lower bound for the minimum distance of these codes from an upper "Weil type" bound for the number of rational points on irreducible…

Information Theory · Computer Science 2015-03-30 Safia Haloui

Ground state counting plays an important role in several applications in science and engineering, from estimating residual entropy in physical systems, to bounding engineering reliability and solving combinatorial counting problems. While…

A central problem in arithmetic geometry is to construct non-torsion rational points on elliptic curves. We study a canonical quadratic point $\xi_C \in {\rm Jac}(C)$ attached to a smooth non-hyperelliptic curve of genus 4 and use it to…

Number Theory · Mathematics 2026-05-15 Jiahui Gao

This paper gives a conjectural characterization of those elliptic curves over the field of complex numbers which "should" be covered by standard modular curves. The elliptic curves in question all have algebraic j-invariant, so they can be…

alg-geom · Mathematics 2015-06-30 Kenneth A. Ribet

A method for compiling quantum algorithms into specific braiding patterns for non-Abelian quasiparticles described by the so-called Fibonacci anyon model is developed. The method is based on the observation that a universal set of quantum…

Quantum Physics · Physics 2007-05-23 L. Hormozi , G. Zikos , N. E. Bonesteel , S. H. Simon