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

Homology of braid groups and Artin groups can be related to the study of spaces of curves. We completely calculate the integral homology of the family of smooth curves of genus $g$ with one boundary component, that are double coverings of…

For any number field K with a complex place, we present an infinite family of elliptic curves defined over K such that $dim \mathbb{F}_2 Sel_2(E^F/K) \ge dim \mathbb{F}_2 E^F(K)[2] + r_2$ for every quadratic twist E^F of every curve E in…

We employ techniques from group theory to show that, in many cases, counting problems on graphs are almost as hard to solve in a small number of instances as they are in all instances. Specifically, we show the following results. 1.…

Let $C$ be a curve of genus $g$ over a field $k$. We describe probabilistic algorithms for addition and inversion of the classes of rational divisors in the Jacobian of $C$. After a precomputation, which is done only once for the curve $C$,…

We describe an exact algorithm for finding the best 2-OPT move which, experimentally, was observed to be much faster than the standard quadratic approach. To analyze its average-case complexity, we introduce a family of heuristic procedures…

For integers $N\geq 3$ and $g\geq 1$, we study bounds on the cardinality of the set of points of order dividing $N$ lying on a hyperelliptic curve of genus $g$ embedded in its jacobian using a Weierstrass point as base point. This leads us…

We present new conditions which obstruct the existence of hyperelliptic Jacobians in isogeny classes of abelian varieties over finite fields of characteristic 2. We show that Weil polynomials of Jacobians cannot have coefficients in certain…

In arithmetic and algebraic geometry, superspecial (s.sp.\ for short) curves are one of the most important objects to be studied, with applications to cryptography and coding theory. If $g \geq 4$, it is not even known whether there exists…

Let $q$ be an odd prime power, and $H_{d,q}$ denote the set of square-free monic polynomials $D(x) \in F_q[x]$ of degree $d$. Katz and Sarnak showed that the moments, over $H_{d,q}$, of the zeta functions associated to the curves…

In this paper, we propose an algorithm to enumerate genus-4 superspecial hyperelliptic curves whose automorphism groups isomorphic to the quaternion group. By implementing this algorithm with Magma, we successfully obtain the number of…

This paper provides an algorithm enumerating superspecial trigonal curves of genus $5$ over finite fields. Executing the algorithm over a computer algebra system Magma, we enumerate them over finite fields $\mathbb{F}_{p^a}$ for any natural…

We find equations for the higher dimensional analogue of the modular curve X_0(3) using Mumford's algebraic formalism of algebraic theta functions. As a consequence, we derive a method for the construction of genus 2 hyperelliptic curves…

We provide new deterministic algorithms for the edge coloring problem, which is one of the classic and highly studied distributed local symmetry breaking problems. As our main result, we show that a $(2\Delta-1)$-edge coloring can be…

In this paper we show how to explicitly write down equations of hyperelliptic curves over Q such that for all odd primes l the image of the mod l Galois representation is the general symplectic group. The proof relies on understanding the…

We consider the moduli space $\Hh_{g,n}$ of $n$-pointed smooth hyperelliptic curves of genus $g$. In order to get cohomological information we wish to make $\s_n$-equivariant counts of the numbers of points defined over finite fields of…

Simplifying polygonal curves at different levels of detail is an important problem with many applications. Existing geometric optimization algorithms are only capable of minimizing the complexity of a simplified curve for a single level of…

Zeilberger's algorithm provides a method to compute recurrence and differential equations from given hypergeometric series representations, and an adaption of Almquist and Zeilberger computes recurrence and differential equations for…

Computing the diameter, and more generally, all eccentricities of an undirected graph is an important problem in algorithmic graph theory and the challenge is to identify graph classes for which their computation can be achieved in…

We develop a fast algorithm for computing the bound of an Ore polynomial over a skew field, under mild conditions. As an application, we state a criterion for deciding whether a bounded Ore polynomial is irreducible, and we discuss a…

One of the big questions in the area of curves over finite fields concerns the distribution of the numbers of points: Which numbers occur as the number of points on a curve of genus $g$? The same question can be asked of various subclasses…