Unconditional proof of Weber's conjecture for k ≤ 12 via Fukuda-Komatsu sieve, cyclotomic tower induction, and Herbrand's theorem.
Lang.Algebraic Number Theory
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A Dickson-polynomial isomorphism yields an O(ep) factorization algorithm for x^{p+1}-1 over Z_{p^e} and near-optimal LCD codes of length 182 over Z_169 with a robustness plateau in minimum distance.
citing papers explorer
-
Module Lattice Security (Part I): Unconditional Verification of Weber's Conjecture for $k \le 12$
Unconditional proof of Weber's conjecture for k ≤ 12 via Fukuda-Komatsu sieve, cyclotomic tower induction, and Herbrand's theorem.
-
Explicit Factorization of $x^{p+1}-1$ over $\mathbb{Z}_{p^e}$: A Structural Approach via Dickson Polynomials
A Dickson-polynomial isomorphism yields an O(ep) factorization algorithm for x^{p+1}-1 over Z_{p^e} and near-optimal LCD codes of length 182 over Z_169 with a robustness plateau in minimum distance.