English
Related papers

Related papers: Sub-Linear Point Counting for Variable Separated C…

200 papers

Given an elliptic curve $E$ defined over the rational numbers and a prime $p$ at which $E$ has good reduction, we consider the Galois deformation ring parametrizing lifts of the residual representation on the $p$-torsion group $E[p]$. For a…

Number Theory · Mathematics 2024-06-28 Anwesh Ray , Tom Weston

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…

Number Theory · Mathematics 2019-06-06 Samuele Anni , Vladimir Dokchitser

The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials (written as sums of monomials). We give recurrence formulae…

Computational Complexity · Computer Science 2007-05-23 Jean Gallier , Weqing Gu

We present algorithms which, given a genus 2 curve $C$ defined over a finite field and a quartic CM field $K$, determine whether the endomorphism ring of the Jacobian $J$ of $C$ is the full ring of integers in $K$. In particular, we present…

Number Theory · Mathematics 2007-06-13 David Freeman , Kristin Lauter

We describe a quasi-linear algorithm for computing Igusa class polynomials of Jacobians of genus 2 curves via complex floating-point approximations of their roots. After providing an explicit treatment of the computations in quartic CM…

Cryptography and Security · Computer Science 2013-12-11 Andreas Enge , Emmanuel Thomé

A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime $p$, reduce its coefficients mod $p$ and consider its action on the field $\mathbb{F}_p$. We say a subset of…

Dynamical Systems · Mathematics 2017-07-27 Andrew Bridy , Derek Garton

Let $f$ be a newform of even weight $2\kappa$ for $D^\times$, where $D$ is a possibly split indefinite quaternion algebra over $\mathbb{Q}$. Let $K$ be a quadratic imaginary field splitting $D$ and $p$ an odd prime split in $K$. We extend…

Number Theory · Mathematics 2019-10-23 Andrea Mori

Modulo a prime number, we define semi-primitive roots as the square of primitive roots. We present a method for calculating primitive roots from quadratic residues, including semi-primitive roots. We then present progressions that generate…

General Mathematics · Mathematics 2024-11-04 Marc Wolf , François Wolf

We study the problem $\#\mathrm{EdgeSub}(\Phi)$ of counting $k$-edge subgraphs satisfying a given graph property $\Phi$ in a large host graph $G$. Building upon the breakthrough result of Curticapean, Dell and Marx (STOC 17), we express the…

Computational Complexity · Computer Science 2021-05-14 Norbert Peyerimhoff , Marc Roth , Johannes Schmitt , Jakob Stix , Alina Vdovina

In this paper, we introduce \textit{splitting numbers} of subvarieties in a smooth variety for a Galois cover, and prove that the splitting numbers are invariant under certain homeomorphisms. By splitting numbers, we give a necessary and…

Algebraic Geometry · Mathematics 2016-03-18 Taketo Shirane

For a prime number $p$ we study the zeros modulo $p$ of divisor polynomials of rational elliptic curves $E$ of conductor $p$. Ono made the observation that these zeros of are often $j$-invariants of supersingular elliptic curves over…

Number Theory · Mathematics 2016-11-18 Matija Kazalicki , Daniel Kohen

We obtain a formula for the degrees of the varieties parameterizing complex algebraic curves of any divisor class and genus on P^2_6, the projective plane blown-up at 6 generic points. Moreover, the formula computes the degrees of the…

Algebraic Geometry · Mathematics 2012-02-28 M. Shoval , E. Shustin

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

The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…

General Mathematics · Mathematics 2007-05-23 Ashok Kumar Mittal , Ashok Kumar Gupta

Let $C$ be a regular geometrically integral curve over an imperfect field $K$ and assume that it admits a non-smooth point $\mathfrak{p}$ which -- seen as a prime of the separable function field $K(C)|K$ -- is non-decomposed in the base…

Algebraic Geometry · Mathematics 2024-09-11 Cesar Hilario , Karl-Otto Stöhr

We generalize a theorem of D. Rohrlich concerning root numbers of elliptic curves over the field of rational numbers. Our result applies to curves of all higher genera over number fields. Namely, under certain conditions which naturally…

Number Theory · Mathematics 2007-05-23 M. Sabitova

Let $p$ and $q$ be distinct prime numbers, with $q\equiv 1\pmod{12}$. Let $N$ be a positive integer that is coprime to $pq$. We prove a formula relating the Hasse--Weil zeta function of the modular curve $X_0(qN)_{\mathbb{F}_q}$ to the…

Number Theory · Mathematics 2023-10-24 Antonio Lei , Katharina Müller

In this paper we propose a novel efficient algorithm for calculating winding numbers, aiming at counting the number of roots of a given polynomial in a convex region on the complex plane. This algorithm can be used for counting and…

Numerical Analysis · Mathematics 2019-08-20 Vitaly Zaderman , Liang Zhao

In a previous joint article with F. Abu Salem, we gave efficient algorithms for Jacobian group arithmetic of "typical" divisor classes on C_{3,4} curves, improving on similar results by other authors. At that time, we could only state that…

Number Theory · Mathematics 2019-08-08 Kamal Khuri-Makdisi

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

Optimization and Control · Mathematics 2008-01-24 Didier Henrion