{"paper":{"title":"The lowest degree $0,1$-polynomial divisible by cyclotomic polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"A.Satyanarayana Reddy","submitted_at":"2011-06-07T07:35:48Z","abstract_excerpt":"Let $n$ be an even positive integer with at most three distinct prime factors and let $\\ze_n$ be a primitive $n$-th root of unity. In this study, we made an attempt to find the lowest-degree $0,1$-polynomial $f(x) \\in \\Q[x]$ having at least three terms such that $f(\\ze_n)$ is a minimal vanishing sum of the $n$-th roots of unity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1271","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"}