English
Related papers

Related papers: Sign choices in the AGM for genus two theta consta…

200 papers

Theta functions and theta constants in low genus, especially genus 1 and 2, can be evaluated at any given point in quasi-linear time in the required precision using Newton schemes based on Borchardt sequences. Our goal in this paper is to…

Numerical Analysis · Mathematics 2022-03-07 Jean Kieffer

We propose to generalize the work of R\'egis Dupont for computing modular polynomials in dimension $2$ to new invariants. We describe an algorithm to compute modular polynomials for invariants derived from theta constants and prove under…

Number Theory · Mathematics 2019-02-20 Enea Milio

Solving Quadratic equation is one of the intrinsic interests as it is the simplest nonlinear equations. A novel approach for solving Quadratic Equation based on Genetic Algorithms (GAs) is presented. Genetic Algorithms (GAs) are a technique…

Neural and Evolutionary Computing · Computer Science 2013-06-20 Tanistha Nayak , Tirtharaj Dash

In this article we give explicit formulas for the equations of a generic genus $4$ curve in terms of its theta constants. The method uses the Prym construction and the beautiful classical geometry around it.

Algebraic Geometry · Mathematics 2024-07-09 Jeroen Hanselman , Andreas Pieper , Sam Schiavone

Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…

Data Structures and Algorithms · Computer Science 2013-07-09 Frederique Bassino , Andrea Sportiello

Given a non-empty genus in $n$ dimensions with determinant $d$, we give a randomized algorithm that outputs a quadratic form from this genus. The time complexity of the algorithm is poly$(n,\log d)$; assuming Generalized Riemann Hypothesis…

Data Structures and Algorithms · Computer Science 2015-03-27 Chandan Dubey , Thomas Holenstein

In this paper, we investigate the size of moments of quadratic character sums averaged over the family of fundamental discriminants. We obtain an asymptotic formula for all integer moments in a restricted range of parameters using a…

Number Theory · Mathematics 2025-10-09 Marc Munsch , Yuichiro Toma

We generalize the construction from arXiv:2102.09329 of theta series for quadratic forms of signature $(n-1,1)$ with homogeneous and spherical polynomials. Namely, we allow that the parameters $c_1,c_2$, which define the theta series and…

Number Theory · Mathematics 2022-01-12 Christina Roehrig , Sander Zwegers

We verify the Invariance Conjectures of tautological equations in genus two. In particular, a uniform derivation of all known genus two equations is given.

Algebraic Geometry · Mathematics 2007-05-23 D. Arcara , Y. -P. Lee

Properties of 2-adic valuation sequences for general quadratic polynomials with integer coefficients are determined directly from the coefficients. These properties include boundedness or unboundedness, periodicity, and valuations at…

Number Theory · Mathematics 2021-09-01 Will Boultinghouse , Jane Long , Olena Kozhushkina , Justin Trulen

Archdeacon and Grable (1995) proved that the genus of the random graph $G\in\mathcal{G}_{n,p}$ is almost surely close to $pn^2/12$ if $p=p(n)\geq3(\ln n)^2n^{-1/2}$. In this paper we prove an analogous result for random bipartite graphs in…

Combinatorics · Mathematics 2020-11-18 Yifan Jing , Bojan Mohar

We give an explicit weak solution to the Schottky problem, in the spirit of Riemann and Schottky. For any genus $g$, we write down a collection of polynomials in genus $g$ theta constants, such that their common zero locus contains the…

Algebraic Geometry · Mathematics 2020-10-13 Hershel Farkas , Samuel Grushevsky , Riccardo Salvati Manni

Finding cliques in random graphs and the closely related "planted" clique variant, where a clique of size t is planted in a random G(n,1/2) graph, have been the focus of substantial study in algorithm design. Despite much effort, the best…

Computational Complexity · Computer Science 2013-11-14 Raghu Meka , Avi Wigderson

This paper concerns quasi-stochastic approximation (QSA) to solve root finding problems commonly found in applications to optimization and reinforcement learning. The general constant gain algorithm may be expressed as the…

Optimization and Control · Mathematics 2024-04-02 Caio Kalil Lauand , Sean Meyn

Towards confirming Sun's conjecture on the strict log-concavity of combinatorial sequence involving the n$th$ Bernoulli number, Chen, Guo and Wang proposed a conjecture about the log-concavity of the function…

Classical Analysis and ODEs · Mathematics 2016-06-30 Bo Ning , Yu Zheng

Recently, all Birch and Swinnerton-Dyer invariants, except for the order of Sha, have been computed for all curves of genus 2 contained in the L-functions and Modular Forms Database. This report explains the improvements made to the…

Number Theory · Mathematics 2023-09-06 Raymond van Bommel

In this paper we present genetic algorithms based search technique for the linear optics schemes, performing two-qubit quantum gates. We successfully applied this technique for finding heralded two-qubit gates and obtained the new schemes…

Quantum Physics · Physics 2023-07-19 A. Chernikov , S. S. Sysoev , E. A. Vashukevich , T. Yu. Golubeva

This work focuses on the numerical approximations of random periodic solutions of stochastic differential equations (SDEs). Under non-globally Lipschitz conditions, we prove the existence and uniqueness of random periodic solutions for the…

Numerical Analysis · Mathematics 2024-06-21 Ziheng Chen , Liangmin Cao , Lin Chen

We use Whitham deformations to give a complete account of spectral data of real solutions of the sinh--Gordon equation of spectral genus 2. We parameterise the closure of spectral data of constant mean curvature tori in $\mathbb{R}^3$ by an…

Differential Geometry · Mathematics 2023-03-07 Emma Carberry , Martin Kilian , Sebastian Klein , Martin Ulrich Schmidt

For many random Constraint Satisfaction Problems, by now, we have asymptotically tight estimates of the largest constraint density for which they have solutions. At the same time, all known polynomial-time algorithms for many of these…

Combinatorics · Mathematics 2017-11-29 Dimitris Achlioptas , Amin Coja-Oghlan
‹ Prev 1 2 3 10 Next ›