Related papers: Computing Hasse-Witt matrices of hyperelliptic cur…

We prove that when suitably normalized, small enough powers of the absolute value of the characteristic polynomial of random Hermitian matrices, drawn from one-cut regular unitary invariant ensembles, converge in law to Gaussian…

We study the moduli space of genus 3 hyperelliptic curves via the weighted projective space of binary octavics. This enables us to create a database of all genus 3 hyperelliptic curves defined over $\mathbb Q$, of weighted moduli height…

For fixed compact connected Lie groups H \subseteq G, we provide a polynomial time algorithm to compute the multiplicity of a given irreducible representation of H in the restriction of an irreducible representation of G. Our algorithm is…

We study the problem of efficiently constructing a curve C of genus 2 over a finite field F for which either the curve C itself or its Jacobian has a prescribed number N of F-rational points. In the case of the Jacobian, we show that any…

We investigate algorithms for encoding of one-point algebraic geometry (AG) codes over certain plane curves called $C_{ab}$ curves, as well as algorithms for inverting the encoding map, which we call "unencoding". Some $C_{ab}$ curves have…

We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…

We describe an algorithm for determining a minimal Weierstrass equation for hyperelliptic curves over principal ideal domains. When the curve has a rational Weierstrass point $w_0$, we also give a similar algorithm for determining the…

We prove general Dwork-type congruences for Hasse--Witt matrices attached to tuples of Laurent polynomials. We apply this result to establishing arithmetic and $p$-adic analytic properties of functions originating from polynomial solutions…

Algorithms for computing the classical Gaussian quadrature rules (Gauss--Jacobi, Gauss--Laguerre, and Gauss--Hermite) are presented, based on globally convergent fourth-order iterative methods combined with asymptotic approximations, which…

Let $f$ be a fixed (holomorphic or Maass) modular cusp form. Let $\cq$ be a Dirichlet character mod $q$. We describe a fast algorithm that computes the value $L(1/2,f\times\chi_q)$ up to any specified precision. In the case when $q$ is…

We give an algorithm to compute the periods of smooth projective hypersurfaces of any dimension. This is an improvement over existing algorithms which could only compute the periods of plane curves. Our algorithm reduces the evaluation of…

We exhibit an algorithm to compute equations of an algebraic curve over a computable characteristic 0 field from the power series expansions of its regular 1-forms at a nonrational point of the curve, extending a 2005 algorithm of Baker,…

Consider a hyperelliptic integral $I=\int P/(Q\sqrt{S}) dx$, $P,Q,S\in\mathbb{K}[x]$, with $[\mathbb{K}:\mathbb{Q}]<\infty$. When $S$ is of degree $\leq 4$, such integral can be calculated in terms of elementary functions and elliptic…

In this paper, we present an improved algorithm for the All Pairs Non-decreasing Paths (APNP) problem on weighted simple digraphs, which has running time $\tilde{O}(n^{\frac{3 + \omega}{2}}) = \tilde{O}(n^{2.686})$. Here $n$ is the number…

We study polynomial-time approximation algorithms for the Quantum Max-Cut (QMC) problem. Given an edge-weighted graph $G$ on n vertices, the QMC problem is to determine the largest eigenvalue of a particular $2^n \times 2^n$ matrix that…

We present a database of rational elliptic curves, up to Q-isomorphism, with good reduction outside {2,3,5,7,11,13}. We provide a heuristic involving the abc and BSD conjectures that the database is likely to be the complete set of such…

This note concerns the theoretical algorithmic problem of counting rational points on curves over finite fields. It explicates how the algorithmic scheme introduced by Schoof and generalized by the author yields an algorithm whose running…

A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…

We provide several new $q$-congruences for truncated basic hypergeometric series, mostly of arbitrary order. Our results include congruences modulo the square or the cube of a cyclotomic polynomial, and in some instances, parametric…

We present a new method for solving the hidden polynomial graph problem (HPGP) which is a special case of the hidden polynomial problem (HPP). The new approach yields an efficient quantum algorithm for the bivariate HPGP even when the input…