Related papers: Hyperelliptic Curves over Small Finite Fields and …

The corresponding Hasse-Weil bound was a major breakthrough in history of mathematics. It has found many applications in mathematics, coding theory and theoretical computer science. In general, the Hasse-Weil bound is tight and cannot be…

Fully Homomorphic Encryption (FHE) enables computation directly on encrypted data but incurs massive computational and memory overheads, often exceeding plaintext execution by several orders of magnitude. While custom ASIC accelerators can…

GPUs are uniquely suited to accelerate (SQL) analytics workloads thanks to their massive compute parallelism and High Bandwidth Memory (HBM) -- when datasets fit in the GPU HBM, performance is unparalleled. Unfortunately, GPU HBMs remain…

We provide a flexible, open-source framework for hardware acceleration, namely massively-parallel execution on general-purpose graphics processing units (GPUs), applied to the hierarchical Poincar\'e--Steklov (HPS) family of algorithms for…

To enable heterogeneous computing systems with autonomous programming and optimization capabilities, we propose a unified, end-to-end, programmable graph representation learning (PGL) framework that is capable of mining the complexity of…

Let p be an odd prime number and g $\ge$ 2 be an integer. We present an algorithm for computing explicit rational representations of isogenies between Jacobians of hyperelliptic curves of genus g over an extension K of the field of p-adic…

A high fidelity flow simulation for complex geometries for high Reynolds number ($Re$) flow is still very challenging, which requires more powerful computational capability of HPC system. However, the development of HPC with traditional CPU…

In the next decade, the demands for computing in large scientific experiments are expected to grow tremendously. During the same time period, CPU performance increases will be limited. At the CERN Large Hadron Collider (LHC), these two…

In this technical note we show how to reach a remarkable speed up when solving elliptic partial differential equations with finite differences thanks to the joint use of the Chebyshev-Jacobi method with high order discretizations and its…

In the classical case of irreducible smooth algebraic curves every genus $2$ curve is hyperelliptic, or in other words there is a complete linear series $g_2^1$ on them. On the other hand if $g > 2$, then a generic smooth curve of genus $2$…

We compute the cohomological invariants with coefficients in $\mathbb{Z}/p\mathbb{Z}$ of the stack $\mathscr{H}_3$ of hyperelliptic curves of genus $3$ over an algebraically closed field.

Connected components and spanning forest are fundamental graph algorithms due to their use in many important applications, such as graph clustering and image segmentation. GPUs are an ideal platform for graph algorithms due to their high…

When the genus $g$ is even, we extend the computation of mod 2 cohomological invariants of $\mathcal{H}_g$ to non algebraically closed fields, we give an explicit functorial description of the invariants and we completely describe their…

We propose an optimization approach for determining both hardware and software parameters for the efficient implementation of a (family of) applications called dense stencil computations on programmable GPGPUs. We first introduce a simple,…

The goal of this work is to give new quantitative results about the distribution of semi-arithmetic hyperbolic surfaces in the moduli space of closed hyperbolic surfaces. We show that two coverings of genus $g$ of a fixed arithmetic surface…

The rapid progress in GPU computing has revolutionized many fields, yet its potential in mathematical programming, such as linear programming (LP), has only recently begun to be realized. This survey aims to provide a comprehensive overview…

We introduce a new collection of partially global Galois cohomology classes subsuming both plectic Heegner points and mock plectic invariants. The former are recovered as localizations of plectic Heegner classes, while the latter arise as…

We present a probabilistic Las Vegas algorithm for computing the local zeta function of a hyperelliptic curve of genus $g$ defined over $\mathbb{F}_q$. It is based on the approaches by Schoof and Pila combined with a modeling of the…

In this paper we study higher even Gaussian maps of the canonical bundle on hyperelliptic curves and we determine their rank, giving explicit descriptions of their kernels. Then we use this descriptions to investigate the hyperelliptic…

In this paper, we present algorithms and implementations for the end-to-end GPU acceleration of matrix-free low-order-refined preconditioning of high-order finite element problems. The methods described here allow for the construction of…