English
Related papers

Related papers: Point counting in families of hyperelliptic curves…

200 papers

In this note, we describe a family of particular algebraic, and nonquadratic, power series over an arbitrary finite field of characteristic 2, having a continued fraction expansion with all partial quotients of degree one. The main purpose…

Number Theory · Mathematics 2015-11-30 Alain Lasjaunias

We address complexity issues for linear differential equations in characteristic $p>0$: resolution and computation of the $p$-curvature. For these tasks, our main focus is on algorithms whose complexity behaves well with respect to $p$. We…

Symbolic Computation · Computer Science 2009-01-27 Alin Bostan , Éric Schost

We introduce a new approach of computing the automorphism group and the field of moduli of points $\p=[C]$ in the moduli space of hyperelliptic curves $\H_g$. Further, we show that for every moduli point $\p \in \H_g(L)$ such that the…

Algebraic Geometry · Mathematics 2007-05-23 Tanush Shaska

We study the second Gaussian map for a curve X of genus g, in relation with the second fundamental form of the period map. We exhibit a class of infinitely many curves with surjective second Gaussian map. We compute its rank on the…

Algebraic Geometry · Mathematics 2008-05-23 Elisabetta Colombo , Paola Frediani

For a polarized complex Abelian variety A, of dimension g>1, we study the function N_A(t) counting the number of elliptic curves in A with degree bounded by t. We describe elliptic curves as solutions of Diophantine equations which, at…

Algebraic Geometry · Mathematics 2014-04-03 Lucio Guerra

Let G=(V,E) be a graph with f:V\to Z_+ a function assigning degree bounds to vertices. We present the first efficient algebraic algorithm to find an f-factor. The time is \tilde{O}(f(V)^{\omega}). More generally for graphs with integral…

Data Structures and Algorithms · Computer Science 2013-04-26 Harold N. Gabow , Piotr Sankowski

We give an explicit formula of the coefficients of the Zeta-Function's L-polynomial for algebraic function fields over finite constant fields. Thus, we deduce an expression of the class number of algebraic function fields defined over…

Algebraic Geometry · Mathematics 2026-02-26 Mahdi Mohamed Koutchoukali

We apply some of the latest techniques from machine-learning to the arithmetic of hyperelliptic curves. More precisely we show that, with impressive accuracy and confidence (between 99 and 100 percent precision), and in very short time…

Number Theory · Mathematics 2023-07-14 Yang-Hui He , Kyu-Hwan Lee , Thomas Oliver

For elliptic curves, expressions for the periods of elliptic integrals of the second kind in terms of theta-constants, have been known since the middle of the 19th century. In this paper we consider the problem of generalizing these results…

Complex Variables · Mathematics 2014-08-29 J. C. Eilbeck , K. Eilers , V. Z. Enolski

We establish identities of Pfaffian type for the theta function associated with twice or half the period matrix of a hyperelliptic curve. They are implied by the large size asymptotic analysis of exact Pfaffian identities for expectation…

Mathematical Physics · Physics 2024-06-25 Gaëtan Borot , Thomas Buc-d'Alché

We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size of the base field, assuming solely the generalized Riemann…

Number Theory · Mathematics 2013-02-19 Gaetan Bisson

We present an efficient deterministic algorithm which outputs exact expressions in terms of $n$ for the number of monic degree $n$ irreducible polynomials over $\mathbb{F}_{q}$ of characteristic $p$ for which the first $l < p$ coefficients…

Algebraic Geometry · Mathematics 2019-01-09 Robert Granger

We study "space efficient" FPT algorithms for graph problems with limited memory. Let n be the size of the input graph and k be the parameter. We present algorithms that run in time f(k)*poly(n) and use g(k)*polylog(n) working space, where…

Data Structures and Algorithms · Computer Science 2025-12-16 Sheikh Shakil Akhtar , Pranabendu Misra , Geevarghese Philip

We investigate the hypergroup property for the family of orthogonal polynomials associated with the deltoid curve in the plane, related to the A 2 root system. This provides also the same property for another family of polynomials related…

Probability · Mathematics 2015-03-25 Dominique Bakry , Olfa Zribi

A message-passing algorithm for counting short cycles in a graph is presented. For bipartite graphs, which are of particular interest in coding, the algorithm is capable of counting cycles of length g, g +2,..., 2g - 2, where g is the girth…

Information Theory · Computer Science 2015-03-14 Mehdi Karimi , Amir H. Banihashemi

Given a class of graphs $\mathcal{H}$, the problem $\oplus\mathsf{Sub}(\mathcal{H})$ is defined as follows. The input is a graph $H\in \mathcal{H}$ together with an arbitrary graph $G$. The problem is to compute, modulo $2$, the number of…

Computational Complexity · Computer Science 2023-10-12 Leslie Ann Goldberg , Marc Roth

We show that an effective version of Siegel's Theorem on finiteness of integer solutions and an application of elementary Galois theory are key ingredients in a complexity classification of some Holant problems. These Holant problems,…

Computational Complexity · Computer Science 2014-04-16 Jin-Yi Cai , Heng Guo , Tyson Williams

Let F be the cubic field of discriminant -23 and O its ring of integers. Let Gamma be the arithmetic group GL_2 (O), and for any ideal n subset O let Gamma_0 (n) be the congruence subgroup of level n. In a previous paper, two of us (PG and…

Number Theory · Mathematics 2014-09-30 Steve Donnelly , Paul E. Gunnells , Ariah Klages-Mundt , Dan Yasaki

In this paper, we show that there exist families of curves (defined over an algebraically closed field $k$ of characteristic $p >2$) whose Jacobians have interesting $p$-torsion. For example, for every $0 \leq f \leq g$, we find the…

Number Theory · Mathematics 2016-01-15 Darren Glass , Rachel Pries

Given a curve $C$ over a number field $K$ equipped with the action of a finite group $G$ by $K$-automorphisms, one obtains a factorisation of $L(C,s)$ into a product of $L$-functions of `motivic pieces of curves' associated to irreducible…

Number Theory · Mathematics 2026-01-30 Harry Spencer