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

We consider multi-variable sigma function of a genus $g$ hyperelliptic curve as a function of two group of variables -jacobian variables and parameters of the curve. In the theta-functional representation of sigma-function, the second group…

We study a class of semistable ordinary hyperelliptic curves over 2-adic fields and the special fibre of their minimal regular model. We show that these curves can be controlled using `cluster pictures', similarly to the case of odd residue…

Complex networks have become increasingly popular for modeling various real-world phenomena. Realistic generative network models are important in this context as they avoid privacy concerns of real data and simplify complex network research…

We study the fluctuations in the distribution of zeros of zeta functions of a family of hyperelliptic curves defined over a fixed finite field, in the limit of large genus. According to the Riemann Hypothesis for curves, the zeros all lie…

In general, the L-polynomial of a curve of genus $g$ is determined by $g$ coefficients. We show that the L-polynomial of a supersingular curve of genus $g$ is determined by fewer than $g$ coefficients.

This paper studies the problem of enumerating all maximal collinear subsets of size at least three in a given set of $n$ points. An algorithm for this problem, besides solving degeneracy testing and the exact fitting problem, can also help…

I present a parallel algorithm for exact probabilistic inference in Bayesian networks. For polytree networks with n variables, the worst-case time complexity is O(log n) on a CREW PRAM (concurrent-read, exclusive-write parallel…

Consider the smooth projective models C of curves y^2=f(x) with f(x) in Z[x] monic and separable of degree 2g+1. We prove that for g >= 3, a positive fraction of these have only one rational point, the point at infinity. We prove a lower…

We present algorithms for computing ranks and order statistics in the Farey sequence, taking time O (n^{2/3}). This improves on the recent algorithms of Pawlewicz [European Symp. Alg. 2007], running in time O (n^{3/4}). We also initiate the…

We study the Newton polygons of numerators of the zeta functions of $2$-rank $0$ hyperelliptic curves in characteristic $2$. We determine their first generic vertex, and their first vertex in some other non generic cases.

Let $K$ be an algebraically closed field of characteristic different from 2, $g$ a positive integer, $f(x)$ a degree $(2g+1)$ polynomial with coefficients in $K$ and without multiple roots, $C: y^2=f(x)$ the corresponding genus $g$…

A Howe curve is a curve of genus $4$ obtained as the fiber product over $\mathbf{P}^1$ of two elliptic curves. Any Howe curve is canonical. This paper provides an efficient algorithm to find superspecial Howe curves and that to enumerate…

In algebraic geometry, enumerating or finding superspecial curves in positive characteristic $p$ is important both in theory and in computation. In this paper, we propose feasible algorithms to enumerate or find superspecial hyperelliptic…

Let E be an elliptic curve over Q, and let n=>1. The central object of study of this article is the division field Q(E[n]) that results by adjoining to Q the coordinates of all n-torsion points on E(Q). In particular, we classify all curves…

Hypergraph clustering is a basic algorithmic primitive for analyzing complex datasets and systems characterized by multiway interactions, such as group email conversations, groups of co-purchased retail products, and co-authorship data.…

As a subproduct of the Schoof-Elkies-Atkin algorithm to count points on elliptic curves defined over finite fields of characteristic p, there exists an algorithm that computes, for l an Elkies prime, l-torsion points in an extension of…

For a partition $lambda=\{lambda_1 \geq \lambda_2 \geq \lambda_3 \}$ of non-negative integers, we calculate the Euler characteristic of the local system $V_{\lambda}$ on the moduli space of genus 3 hyperelliptic curves using a suitable…

In this paper, we determine the reduced automorphism groups of hyperelliptic curves of a small genus in characteristic $2$, when they are of $2$-rank $0$. Such a curve is an Artin-Schreier curve defined in the form $y^2-y=f(x)$ for a…

We study the exact counting problem for all lattice rectangles contained in the square $[0,n)\times[0,n)$, including non-axis-parallel ones. Starting from the standard parametrization by a primitive direction $(u,v)$ and two side lengths,…

The elliptic curve method (ECM) is one of the best factorization methods available. It is possible to use hyperelliptic curves instead of elliptic curves but it is in theory slower. We use special hyperelliptic curves and Kummer surfaces to…