{"paper":{"title":"A note about complexity of lens spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Maria Rita Casali, Paola Cristofori","submitted_at":"2013-09-23T08:44:39Z","abstract_excerpt":"Within crystallization theory, (Matveev's) complexity of a 3-manifold can be estimated by means of the combinatorial notion of GM-complexity. In this paper, we prove that the GM-complexity of any lens space L(p,q), with p greater than 2, is bounded by S(p,q)-3, where S(p,q) denotes the sum of all partial quotients in the expansion of q/p as a regular continued fraction. The above upper bound had been already established with regard to complexity; its sharpness was conjectured by Matveev himself and has been recently proved for some infinite families of lens spaces by Jaco, Rubinstein and Tillm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5728","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"}