Related papers: Improved rank bounds from 2-descent on hyperellipt…

We establish several gradient estimates for second-order divergence type parabolic and elliptic systems. The coefficients and data are assumed to be H\"older or Dini continuous in the time variable and all but one spatial variables. This…

The two dimensional Jacobian Conjecture says that a morphism $f:\mathbb{C}[x,y]\to \mathbb{C}[x,y]$ having an invertible Jacobian, is invertible. We show that a morphism $f$ having an invertible Jacobian is invertible, in each of the…

We revisit the classical dual ascent algorithm for minimization of convex functionals in the presence of linear constraints, and give convergence results which apply even for non-convex functionals. We describe limit points in terms of the…

In the previous paper, Hirakawa and the author determined the set of rational points of a certain infinite family of hyperelliptic curves $C^{(p;i,j)}$ parametrized by a prime number $p$ and integers $i$, $j$. In the proof, we used the…

We investigate the rank gain of elliptic curves, and more generally, Jacobian varieties, over non-Galois extensions whose Galois closure has Galois group permutation-isomorphic to a prescribed group $G$ (in short, "$G$-extensions"). In…

It is well-known that abelian varieties are projective, and so that there exist explicit polynomial and rational functions which define both the variety and its group law. It is however difficult to find any explicit polynomial and rational…

Finding the optimal hyperparameters of a model can be cast as a bilevel optimization problem, typically solved using zero-order techniques. In this work we study first-order methods when the inner optimization problem is convex but…

We show that Lang's conjecture on error terms in Diophantine approximation implies Honda's conjecture on ranks of elliptic curves over number fields. We also show that even a very weak version of Lang's error term conjecture would be enough…

We describe an algorithm that provably computes the rational torsion subgroup of the Jacobian of a curve without relying on height bounds. Instead, the strategy is to find upper bounds for the torsion subgroup using reduction modulo primes,…

We develop a new method for equality constrained optimization problems based on a sequential cubic programming framework. Each iteration utilizes a step decomposition based on the Jacobian of the constraints into a normal and a tangential…

Rank computation of elliptic curves has deep relations with various unsolved questions in number theory, most notably in the congruent number problem for right-angled triangles. Similar relations between elliptic curves and Heron triangles…

In this short note, we present a trick to ensure that the Jacobian of a given smooth curve over a number field has strictly positive Mordell-Weil rank. More explicitly, we prove that a smooth curve with no rational non-trivial 2-torsion and…

We develop refined methods to effectively bound the dimension of Bloch-Kato Selmer groups associated to the higher Chow group $\mathrm{CH}^2(J,1)$, where $J$ is the Jacobian of a hyperelliptic curve $X$. This extends the recent work of…

We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…

We give a formula for the component at p of the p-adic height pairing of a divisor of degree 0 on a hyperelliptic curve. We use this to give a Chabauty-like method for finding p-adic approximations to p-integral points on such curves when…

Genus 2 curves have been an object of much mathematical interest since eighteenth century and continued interest to date. They have become an important tool in many algorithms in cryptographic applications, such as factoring large numbers,…

Let $C=Z(f)$ be a reduced plane curve of degree $6k$, with only nodes and ordinary cusps as singularities. Let $I$ be the ideal of the points where $C$ has a cusp. Let $\oplus S(-b_i)\to \oplus S(-a_i) \to S\to S/I$ be a minimal resolution…

Many optimization problems require balancing multiple conflicting objectives. As gradient descent is limited to single-objective optimization, we introduce its direct generalization: Jacobian descent (JD). This algorithm iteratively updates…

Let $\mathcal{X}$ be a Riemann surface of genus $g>0$ defined over a number field $K$ which is a degree $d$-covering of $\mathbb{P}^1_K$. In this paper we show the existence of infinitely many linearly disjoint degree $d$-extensions $L/K$…

Many problems give rise to polynomial systems. These systems often have several parameters and we are interested to study how the solutions vary when we change the values for the parameters. Using predictor-corrector methods we track the…