15 problems
Given a modular polynomial equation and the associated lattice-based Coppersmith method, determine the optimal asymptotic region of exponents…
Let and be the cycles associated with Algorithm, and suppose and . For each modular symbol in step A of the algorithm, choose…
Let be a modular symbol with , and define … Let be the standard basis of . The quadratic form i…
Let be a modular symbol with . Define … For a top-dimensional cone in the Voronoi decomposition containing…
Let be an integer. Suppose that has no fixed prime divisors as ranges over the integers, with and for . Strong H…
Non-negligible-prime-ideal conjecture. The proportion of such coefficient vectors is inverse-polynomial in and :
Let be a positive integer, let be the maximal real subfield of the th cyclotomic field, and let denote its class number. Polynomi…
Let be the minimizers of Problem, and let be the series associated to and , respectively. Let and…
The computational refinement of the 1-3-5 conjecture. Except for , every such has a representation for whi…
Let , and let be the corresponding genus-two curve, with denoting the rank quantity used in the source. Rational-points conjecture. For , the values…
For each even weight and level , let be the set of quadratic-twist classes of classical newforms with rational coefficients and no complex multiplication, represent…
Let , , , , and be as above, and let be the set of integers with exactly distinct prime divisors, each having signature matching…
Denominator conjecture. The polynomial is the denominator of every coefficient of the three modular polynomials in the functions .
Generalized Borchardt mean identity. With the notation above, the displayed identity holds for all such and . This extends the preceding Borchardt mean formula from…
Let be large, and let be an interval contained in whose length is at most for some absolute constant . Square-root barrier conjecture. There e…