The polynomial bound conjecture for real cyclotomic class numbers

From papers

Let mm be a positive integer, let Q(ζm+ζm1)\mathbb{Q}(\zeta_m+\zeta_m^{-1}) be the maximal real subfield of the mmth cyclotomic field, and let h+(m)h^+(m) denote its class number. Polynomial bound conjecture. There is a fixed polynomial poly\operatorname{poly} such that, for all integers mm,

h+(m)poly(m).h^+(m)\leq \operatorname{poly}(m).

This is presented as a precise form of the folklore conjecture that the real cyclotomic class number is small but hard to compute. Its resolution would support the claimed efficiency benefits for the cyclotomic-field quantum algorithms, but no resolution is supplied in the source.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Razvan Barbulescu and Adrien Poulalion, “The special case of cyclotomic fields in quantum algorithms for unit groups”, arXiv:2303.03978 (2023).

Solutions 0

No solutions have been posted yet.