Related papers: Rigorous methods for computational number theory
We describe a new algorithm for computing the ideal class group, the regulator and a system of fundamental units in number fields under the generalized Riemann hypothesis. We use sieving techniques adapted from the number field sieve…
The main purpose of this paper is to develop new algorithms for computing invariant rings in a general setting. This includes invariants of nonreductive groups but also of groups acting on algebras over certain rings. In particular, we…
We study Euclidean ideal classes in real biquadratic fields and obtain unconditional existence results via genus theory. Lenstra showed (assuming the Generalized Riemann Hypothesis) that a number field with unit rank at least one admits a…
According to Haar's Theorem, every compact group $G$ admits a unique (regular, right and) left-invariant Borel probability measure $\mu_G$. Let the Haar integral (of $G$) denote the functional $\int_G:\mathcal{C}(G)\ni f\mapsto \int…
In this paper, we describe an algorithm that efficiently collect relations in class groups of number fields defined by a small defining polynomial. This conditional improvement consists in testing directly the smoothness of principal ideals…
We present an improved algorithm for tabulating class groups of imaginary quadratic fields of bounded discriminant. Our method uses classical class number formulas involving theta-series to compute the group orders unconditionally for all…
We consider the problem of deterministically factoring a univariate polynomial over a finite field under the assumption of the Extended Riemann Hypothesis (ERH). This work builds upon the line of approach first explored by Gao in $2001$.…
Let $K$ be a number field and let $G$ be a finitely generated subgroup of $K^\times$. For all but finitely many primes $\mathfrak p$ of $K$, the reduction $(G \bmod \mathfrak p)$ generates a well-defined subgroup of the multiplicative group…
Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to…
We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size of the base field, assuming solely the generalized Riemann…
We consider the problem of sampling and approximately counting an arbitrary given motif $H$ in a graph $G$, where access to $G$ is given via queries: degree, neighbor, and pair, as well as uniform edge sample queries. Previous algorithms…
Explicit bounds are given on the norms of prime ideals generating arbitrary subgroups of ray class groups of number fields, assuming the Extended Riemann Hypothesis. These are the first explicit bounds for this problem, and are…
We present an algorithm that unconditionally computes a representation of the unit group of a number field of discriminant $\Delta_K$, given a full-rank subgroup as input, in asymptotically fewer bit operations than the baby-step giant-step…
Exponential integrators based on contour integral representations lead to powerful numerical solvers for a variety of ODEs, PDEs, and other time-evolution equations. They are embarrassingly parallelizable and lead to global-in-time…
We perform forward error analysis for a large class of recursive matrix multiplication algorithms in the spirit of [D. Bini and G. Lotti, Stability of fast algorithms for matrix multiplication, Numer. Math. 36 (1980), 63--72]. As a…
A central question in mathematics and computer science is the question of determining whether a given ideal $I$ is prime, which geometrically corresponds to the zero set of $I$, denoted $Z(I)$, being irreducible. The case of principal…
We introduce a novel approach to perform first-order optimization with orthogonal and unitary constraints. This approach is based on a parametrization stemming from Lie group theory through the exponential map. The parametrization…
In [BDyDF08] Belabas, Diaz y Diaz and Friedman show a way to determine, assuming the Generalized Riemann Hypothesis, a set of prime ideals that generate the class group of a number field. Their method is efficient because it produces a set…
We consider the question of learning the natural parameters of a $k$ parameter minimal exponential family from i.i.d. samples in a computationally and statistically efficient manner. We focus on the setting where the support as well as the…
We consider the classical problem of learning, with arbitrary accuracy, the natural parameters of a $k$-parameter truncated \textit{minimal} exponential family from i.i.d. samples in a computationally and statistically efficient manner. We…