相关论文: Point counting in families of hyperelliptic curves…

Let $C: y^2=f(x)$ be a hyperelliptic curve of genus $g\geq 1$, defined over a complete discretely valued field $K$, with ring of integers $O_K$. Under certain conditions on $C$, mild when residue characteristic is not $2$, we explicitly…

A graph $G$ is contractible to a graph $H$ if there is a set $X \subseteq E(G)$, such that $G/X$ is isomorphic to $H$. Here, $G/X$ is the graph obtained from $G$ by contracting all the edges in $X$. For a family of graphs $\cal F$, the…

We describe a general purpose algorithm for counting simple cycles and simple paths of any length $\ell$ on a (weighted di)graph on $N$ vertices and $M$ edges, achieving a time complexity of $O\left(N+M+\big(\ell^\omega+\ell\Delta\big)…

A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…

The currently best known algorithms for the numerical evaluation of hypergeometric constants such as $\zeta(3)$ to $d$ decimal digits have time complexity $O(M(d) \log^2 d)$ and space complexity of $O(d \log d)$ or $O(d)$. Following work…

Effective reconstruction formulas of a curve from its theta hyperplanes are known classically in genus 2 (where the theta hyperplanes are Weierstrass points), and 3 (where, for a generic curve, the theta hyperplanes are bitangents to a…

In this work we present an explicit relation between the number of points on a family of algebraic curves over $\F_{q}$ and sums of values of certain hypergeometric functions over $\F_{q}$. Moreover, we show that these hypergeometric…

Hyperbolicity measures, in terms of (distance) metrics, how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen intensive research over the last years. Unfortunately, the best…

We consider a quantum polynomial-time algorithm which solves the discrete logarithm problem for points on elliptic curves over $GF(2^m)$. We improve over earlier algorithms by constructing an efficient circuit for multiplying elements of…

Elliptic curves over finite fields GF(2^n) play a prominent role in modern cryptography. Published quantum algorithms dealing with such curves build on a short Weierstrass form in combination with affine or projective coordinates. In this…

For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…

In this work we propose an algorithm that numerically evaluates Kleinian hyperelliptic functions associated with a complex curve of genus 2. This algorithm is based upon constructing a sequence of curves with Richelot isogenous Jacobians…

We study the averages of products of traces of high powers of the Frobenius class of hyperelliptic curves of genus g over a fixed finite field. We show that for increasing genus g, the limiting expectation of these products equals to the…

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…

Fixing $t \in \mathbb{R}$ and a finite field $\mathbb{F}_q$ of odd characteristic, we give an explicit upper bound on the proportion of genus $g$ hyperelliptic curves over $\mathbb{F}_q$ whose zeta function vanishes at $\frac{1}{2} + it$.…

Let E be an elliptic curve without complex multiplication (CM) over a number field K, and let G_E(ell) be the image of the Galois representation induced by the action of the absolute Galois group of K on the ell-torsion subgroup of E. We…

We use a recent characterization of minimal value set polynomials and $q$- Frobenius nonclassical curves to construct curves that generalize the Hermitian curve. The genus $g$ and the number $N$ of $\mathbb{F}_q$-rational points of the…

We prove formulas for power moments for point counts of elliptic curves over a finite field $k$ such that the groups of $k$-points of the curves contain a chosen subgroup. These formulas express the moments in terms of traces of Hecke…

We prove that for any pair of integers 0\leq r\leq g such that g\geq 3 or r>0, there exists a (hyper)elliptic curve C over F_2 of genus g and 2-rank r whose automorphism group consists of only identity and the (hyper)elliptic involution. As…

In this paper we enumerate nonhyperelliptic superspecial curves of genus $4$ over prime fields of characteristic $p\le 11$. Our algorithm works for nonhyperelliptic curves over an arbitrary finite field in characteristic $p \ge 5$. We…