Related papers: Improved rank bounds from 2-descent on hyperellipt…
Transforming a matrix over a field to echelon form, or decomposing the matrix as a product of structured matrices that reveal the rank profile, is a fundamental building block of computational exact linear algebra. This paper surveys the…
Let $q = 2^n$, and let $E / \mathbb{F}_{q^{\ell}}$ be a generalized Galbraith--Lin--Scott (GLS) binary curve, with $\ell \ge 2$ and $(\ell, n) = 1$.We show that the GLS endomorphism on $E / \mathbb{F}_{q^{\ell}}$ induces an efficient…
Most machine learning methods require tuning of hyper-parameters. For kernel ridge regression with the Gaussian kernel, the hyper-parameter is the bandwidth. The bandwidth specifies the length scale of the kernel and has to be carefully…
Given an elliptic curve $E/\mathbb{Q}$, it is a conjecture of Goldfeld that asymptotically half of its quadratic twists will have rank zero and half will have rank one. Nevertheless, higher rank twists do occur: subject to the parity…
We give a brief report on our computations of linear determinantal representations of smooth plane cubics over finite fields. After recalling a classical interpretation of linear determinantal representations as rational points on the…
Caro and Pasten gave an explicit upper bound on the number of rational points on a hyperbolic surface that is embedded in an abelian variety of rank at most one. We show how to use their method to produce a refined bound on the number of…
We propose a gradient descent method for solving optimization problems arising in settings of tropical geometry - a variant of algebraic geometry that has attracted growing interest in applications such as computational biology, economics,…
We provide an algorithm for computing an effective basis of homology of elliptic surfaces over the complex projective line on which integration of periods can be carried out. This allows the heuristic recovery of several algebraic…
We establish basic information about border rank algorithms for the matrix multiplication tensor and other tensors with symmetry. We prove that border rank algorithms for tensors with symmetry (such as matrix multiplication and the…
In this article we give an algorithm for the computation of the number of rational points on the Jacobian variety of a generic ordinary hyperelliptic curve defined over a finite field of cardinality $q$ with time complexity $O(n^{2+o(1)})$…
In this paper, we propose a Jacobi-type algorithm to solve the low rank orthogonal approximation problem of symmetric tensors. This algorithm includes as a special case the well-known Jacobi CoM2 algorithm for the approximate orthogonal…
An effective numerical method is presented for optimizing model parameters that can be applied to any type of system of non-linear equations and any number of data-points, which does not require explicit formulation of the objective…
We explain how one can efficiently determine the (finite) set of rational points on a curve of genus 2 over $\mathbb Q$ with Jacobian variety $J$, given a point $P \in J(\mathbb Q)$ generating a subgroup of finite index in $J(\mathbb Q)$.
The study of solutions with fixed energy of certain classes of Lagrangian (or Hamiltonian) systems is reduced, via the classical Maupertuis--Jacobi variational principle, to the study of geodesics in Riemannian manifolds. We are interested…
In this paper we prove the $\Gamma_{00}$ conjecture of van Geemen and van der Geer, under the additional assumption that the matrix of coefficients of the tangent has rank at most 2. This assumption is satisfied by Jacobians, and thus our…
This paper presents a detailed discussion of the ``Newton's method'' algorithm for finding apparent horizons in 3+1 numerical relativity. We describe a method for computing the Jacobian matrix of the finite differenced $H(h)$ function by…
We produce new explicit examples of genus-2 curves over the rational numbers whose Jacobian varieties have rational torsion points of large order. In particular, we produce a family of genus-2 curves over Q whose Jacobians have a rational…
We obtain existence and convergence theorems on two variants of the proximal point algorithm for proper lower semicontinuous convex functions in complete geodesic spaces with curvature bounded above.
We establish a weighted pointwise Jacobian determinant inequality on corank 1 Carnot groups related to optimal mass transportation akin to the work of Cordero-Erausquin, McCann and Schmuckenschl\"ager. In this setting, the presence of…
We study the family of elliptic curves $y^2=x(x-a^2)(x-b^2)$ parametrized by Pythagorean triples $(a,b,c)$. We prove that for a generic triple the lower bound of the rank of the Mordell-Weil group over $\mathbb{Q}$ is 1, and for some…