Related papers: Rigorous methods for computational number theory
This is the first of a series of papers in which we study deep computations (ultracomputations) and deep iterates, formalizing the ideas of "asymptotic limit" of computations and compositional iterates, respectively. In this first paper of…
The complexity of the elliptic curve method of factorization (ECM) is proven under the celebrated conjecture of existence of smooth numbers in short intervals. In this work we tackle a different version of ECM which is actually much more…
Estimating observable expectation values in eigenstates of quantum systems has a broad range of applications and is an area where early fault-tolerant quantum computers may provide practical quantum advantage. We develop a hybrid…
We consider the Bayesian optimal filtering problem: i.e. estimating some conditional statistics of a latent time-series signal from an observation sequence. Classical approaches often rely on the use of assumed or estimated transition and…
We describe a practical algorithm for computing Brauer-Manin obstructions to the existence of rational points on hyperelliptic curves defined over number fields. This offers advantages over descent based methods in that its correctness does…
Clustering is a hard discrete optimization problem. Nonconvex approaches such as low-rank semidefinite programming (SDP) have recently demonstrated promising statistical and local algorithmic guarantees for cluster recovery. Due to the…
A Comprehensive Grobner system for a parametric ideal I in K(A)[X] represents the collection of all Grobner bases of the ideals I' in K[X] obtained as the values of the parameters A vary in K. The recent algorithms for computing them…
We provide a general mathematical framework for selective inference with supervised model selection procedures characterized by quadratic forms in the outcome variable. Forward stepwise with groups of variables is an important special case…
This expository note presents simplifications of a theorem due to Gy\H{o}ri and an algorithm due to Franzblau and Kleitman: Given a family $F$ of $m$ intervals on a linearly ordered set of $n$ elements, we can construct in $O(m+n)^2$ steps…
In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…
We confirm the eventual evasiveness of several classes of monotone graph properties under widely accepted number theoretic hypotheses. In particular we show that Chowla's conjecture on Dirichlet primes implies that (a) for any graph $H$,…
This document contains notes based on lectures given by Hendrik Lenstra at the PCMI summer school 2022. There are many problems in algebraic number theory which one would like to solve algorithmically, for example computation of the maximal…
We consider a new group testing model wherein each item is a binary random variable defined by an a priori probability of being defective. We assume that each probability is small and that items are independent, but not necessarily…
In the subgraph counting problem, we are given a input graph $G(V, E)$ and a target graph $H$; the goal is to estimate the number of occurrences of $H$ in $G$. Our focus here is on designing sublinear-time algorithms for approximately…
The ultimate objective of this paper is to create a stepping stone to the development of new quantum algorithms. The strategy chosen is to begin by focusing on the class of abelian quantum hidden subgroup algorithms, i.e., the class of…
We propose a new hierarchy of semidefinite programming relaxations for inference problems. As test cases, we consider the problem of community detection in block models. The vertices are partitioned into $k$ communities, and a graph is…
The classical Brauer-Siegel conjecture describes the asymptotic behaviour of the product of the class number and the regulator in families of number fields. All known cases of the conjecture rely on reducing the problem, via group theoretic…
We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…
This paper argues that the requirement of applicableness of quantum linearity to any physical level from molecules and atoms to the level of macroscopic extensional world, which leads to a main foundational problem in quantum theory…
The proliferation of automated inference algorithms in Bayesian statistics has provided practitioners newfound access to fast, reproducible data analysis and powerful statistical models. Designing automated methods that are also both…