{"paper":{"title":"Efficient computation of the Euler-Kronecker constants of prime cyclotomic fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Alessandro Languasco","submitted_at":"2019-03-13T13:50:26Z","abstract_excerpt":"We introduce a new algorithm, which is faster and requires less computing resources than the ones previously known, to compute the Euler-Kronecker constants $\\mathfrak{G}_q$ for the prime cyclotomic fields $\\mathbb{Q}(\\zeta_q)$, where $q$ is an odd prime and $\\zeta_q$ is a primitive $q$-root of unity. With such a new algorithm we evaluated $\\mathfrak{G}_q$ and $\\mathfrak{G}_q^+$, where $\\mathfrak{G}_q^+$ is the Euler-Kronecker constant of the maximal real subfield of $\\mathbb{Q}(\\zeta_q)$, for some very large primes $q$ thus obtaining two new negative values of $\\mathfrak{G}_q$: $\\mathfrak{G}_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05487","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1903.05487/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}