English
Related papers

Related papers: Improved Complexity Bounds for Counting Points on …

200 papers

It is known that in the case of hyperelliptic curves the Shafarevich conjecture can be made effective, i.e., for any number field k and any finite set of places S of k, one can effectively compute the set of isomorphism classes of…

Number Theory · Mathematics 2012-03-06 Aaron Levin

A {\em local graph partitioning algorithm} finds a set of vertices with small conductance (i.e. a sparse cut) by adaptively exploring part of a large graph $G$, starting from a specified vertex. For the algorithm to be local, its complexity…

Data Structures and Algorithms · Computer Science 2008-11-25 Reid Andersen , Yuval Peres

We present an algorithm which, given a connected smooth projective curve $X$ over an algebraically closed field of characteristic $p>0$ and its Hasse--Witt matrix, as well as a positive integer $n$, computes all \'etale Galois covers of $X$…

Number Theory · Mathematics 2025-09-16 Christophe Levrat , Rubén Muñoz--Bertrand

The local topological zeta function is a rational function associated to a germ of a complex holomorphic function. This function can be computed from an embedded resolution of singularities of the germ. For nondegenerate functions it is…

Algebraic Geometry · Mathematics 2008-05-14 Ann Lemahieu , Lise Van Proeyen

Combining $2$-descent techniques with Riemann-Roch and B\'ezout's theorems, we give an upper bound on the number of rational points of bounded height on elliptic and hyperelliptic curves over function fields of characteristic $\neq 2$. We…

Number Theory · Mathematics 2025-10-16 Jean Gillibert , Emmanuel Hallouin , Aaron Levin

We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…

Algebraic Geometry · Mathematics 2007-05-23 J. Maurice Rojas

Local tensor methods are a class of optimization algorithms that was introduced in [Hastings,arXiv:1905.07047v2][1] as a classical analogue of the quantum approximate optimization algorithm (QAOA). These algorithms treat the cost function…

Quantum Physics · Physics 2021-05-19 Aniruddha Bapat , Stephen P. Jordan

The compact genetic algorithm (cGA) is an non-elitist estimation of distribution algorithm which has shown to be able to deal with difficult multimodal fitness landscapes that are hard to solve by elitist algorithms. In this paper, we…

Neural and Evolutionary Computing · Computer Science 2022-04-12 Frank Neumann , Dirk Sudholt , Carsten Witt

Let $C$ be an irreducible, reduced, non-degenerate curve, of arithmetic genus $g$ and degree $d$, in the projective space $\mathbf P^4$ over the complex field. Assume that $C$ satisfies the following {\it flag condition of type $(s,t)$}:…

Algebraic Geometry · Mathematics 2019-05-06 Vincenzo Di Gennaro

In algebraic geometry, it is important to provide effective parametrizations for families of curves, both in theory and in practice. In this paper, we present such an effective parametrization for the moduli of genus-$5$ curves that are…

Algebraic Geometry · Mathematics 2023-11-21 Momonari Kudo , Shushi Harashita

A number of recent papers -- e.g. Brandt et al. (STOC 2016), Chang et al. (FOCS 2016), Ghaffari & Su (SODA 2017), Brandt et al. (PODC 2017), and Chang & Pettie (FOCS 2017) -- have advanced our understanding of one of the most fundamental…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-04-06 Alkida Balliu , Juho Hirvonen , Janne H. Korhonen , Tuomo Lempiäinen , Dennis Olivetti , Jukka Suomela

In this short note we prove a formula for local heights on elliptic curves over number fields in terms of intersection theory on a regular model over the ring of integers.

Number Theory · Mathematics 2014-01-28 Vincenz Busch , Jan Steffen Müller

In this work, we present a fast distributed algorithm for local potential problems: these are graph problems where the task is to find a locally optimal solution where no node can unilaterally improve the utility in its local neighborhood…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-20 Alkida Balliu , Thomas Boudier , Francesco d'Amore , Fabian Kuhn , Dennis Olivetti , Gustav Schmid , Jukka Suomela

We study when the \emph{optimization curve} of first-order methods -- the sequence \${f(x\_n)}*{n\ge0}\$ produced by constant-stepsize iterations -- is convex, equivalently when the forward differences \$f(x\_n)-f(x*{n+1})\$ are…

Optimization and Control · Mathematics 2025-09-12 Le Duc Hieu

Let $K$ be a number field, $S$ a finite set of places. For $\mathbb{G}_m$ or an elliptic curve $E$ defined over $K$, we establish uniformity results on the number of $S$-integral torsion points relative to a non-torsion point $\beta$, as…

Number Theory · Mathematics 2026-01-30 Jit Wu Yap

We give a condition for a hyperelliptic curve $C$ over a local field $K$ to be locally soluble, on the condition that $C$ obtains semistable reduction after a tame extension of $K$, and that the residue field $k$ is sufficiently large…

Number Theory · Mathematics 2021-08-24 Omri Faraggi

Baader, J\"org, and Parlier recently established an upper bound for the crossing number of curve systems of size $m\asymp g^{1+\alpha}$ on a genus $g$ surface, obtaining a leading coefficient of $9/4=2.25$. Their construction relies on…

Geometric Topology · Mathematics 2026-02-03 Hyungryul Baik

We show that there is a bound depending only on g and [K:Q] for the number of K-rational points on a hyperelliptic curve C of genus g over a number field K such that the Mordell-Weil rank r of its Jacobian is at most g-3. If K = Q, an…

Number Theory · Mathematics 2015-11-26 Michael Stoll

We consider the problem of shape restricted nonparametric regression on a closed set X ?\in R; where it is reasonable to assume the function has no more than H local extrema interior to X: Following a Bayesian approach we develop a…

Methodology · Statistics 2016-04-06 Matthew W. Wheeler , David B. Dunson , Amy H. Herring

Let $\epsilon>0$. In this article we will present a deterministic algorithm which does the following. The input is a hyperelliptic curve $C$ of genus $g$ over a finite field $k$ of cardinality $q$ given by $y^2+h(x)y=f(x)$ such that the…

Number Theory · Mathematics 2014-02-27 Michiel Kosters
‹ Prev 1 8 9 10 Next ›