Related papers: Hyperelliptic Curves over Small Finite Fields and …
Real-time, energy-efficient inference on edge devices is essential for graph classification across a range of applications. Hyperdimensional Computing (HDC) is a brain-inspired computing paradigm that encodes input features into…
We present an efficient algorithm to compute the Hasse-Witt matrix of a hyperelliptic curve C/Q modulo all primes of good reduction up to a given bound N, based on the average polynomial-time algorithm recently introduced by Harvey. An…
Hypergraph partitioning is a pervasive NP-hard problem, and accelerating its computation on GPU can both slice time-to-solution and raise quality of results. In this work, we implement a multi-level hypergraph partitioning algorithm on GPU…
We study hyperelliptic curves y^2=f(x) over local fields of odd residue characteristic. We introduce the notion of a "cluster picture" associated to the curve, that describes the p-adic distances between the roots of f(x), and show that…
Achieving high performance for GPU codes requires developers to have significant knowledge in parallel programming and GPU architectures, and in-depth understanding of the application. This combination makes it challenging to find…
We consider generalizations of Szpiro's classical discriminant conjecture to hyperelliptic curves over a number field $K$, and to smooth, projective and geometrically connected curves $X$ over $K$ of genus at least one. The main results…
Persistent homology is perhaps the most popular and useful tool offered by topological data analysis, with point-cloud data being the most common setup. Its older cousin, the Euler characteristic curve (ECC) is less expressive, but far…
High Performance Computing (HPC) platforms allow scientists to model computationally intensive algorithms. HPC clusters increasingly use General-Purpose Graphics Processing Units (GPGPUs) as accelerators; FPGAs provide an attractive…
We describe an algorithm for counting points on an arbitrary hyperelliptic curve over a finite field of odd characteristic, using Monsky-Washnitzer cohomology to compute a p-adic approximation to the characteristic polynomial of Frobenius.…
In this article, we investigate Hecke modifications of vector bundles on a smooth projective curve $X$ defined over an arbitrary field. We obtain structural results that allow us to reduce the classification problem of Hecke modifications…
This paper discusses the potential of graphics processing units (GPUs) in high-dimensional optimization problems. A single GPU card with hundreds of arithmetic cores can be inserted in a personal computer and dramatically accelerates many…
As a first approximation beyond linearity, the nonlinear Schr\"odinger equation (NLSE) reliably describes a broad class of physical systems. Though numerical solutions of this model are well-established, these methods can be computationally…
We study the arithmetic (geometric) progressions in the $x$-coordinates of quadratic points on smooth projective planar curves defined over a number field $k$. Unless the curve is hyperelliptic, we prove that these progressions must be…
Clawpack is a library for solving nonlinear hyperbolic partial differential equations using high-resolution finite volume methods based on Riemann solvers and limiters. It supports Adaptive Mesh Refinement (AMR), which is essential in…
We study the locus of smooth hypersurfaces inside the Hilbert scheme of a smooth projective complex variety. In the spirit of scanning, we construct a map to a continuous section space of a projective bundle, and show that it induces an…
We introduce a fusion of GPU accelerated primal heuristics for Mixed Integer Programming. Leveraging GPU acceleration enables exploration of larger search regions and faster iterations. A GPU-accelerated PDLP serves as an approximate LP…
We give a method for the computation of integral points on a hyperelliptic curve of odd degree over the rationals whose genus equals the Mordell-Weil rank of its Jacobian. Our approach consists of a combination of the $p$-adic approximation…
We study arithmetical and geometrical properties of {\it maximal curves}, that is, curves defined over the finite field $\mathbb F_{q^2}$ whose number of $\mathbb F_{q^2}$-rational points reachs the Hasse-Weil upper bound. Under a…
Next generation High-Energy Physics (HEP) experiments are presented with significant computational challenges, both in terms of data volume and processing power. Using compute accelerators, such as GPUs, is one of the promising ways to…
Boix, De Stefani and Vanzo have characterized ordinary/supersingular elliptic curves over $\mathbb{F}_p$ in terms of the level of the defining cubic homogenous polynomial. We extend their study to arbitrary genus, in particular we prove…