{"paper":{"title":"Dilogarithm ladders from Wilson loops","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"hep-th","authors_text":"Marco S. Bianchi, Matias Leoni","submitted_at":"2014-11-18T20:59:36Z","abstract_excerpt":"We consider a light-like Wilson loop in N=4 SYM evaluated on a regular n-polygon contour. Sending the number of edges to infinity the polygon approximates a circle and the expectation value of the light-like WL is expected to tend to the localization result for the circular one. We show this explicitly at one loop, providing a prescription to deal with the divergences of the light-like WL and the large n limit. Taking this limit entails evaluating certain sums of dilogarithms which, for a regular polygon, evaluate to the same constant independently of n. We show that this occurs thanks to unde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5012","kind":"arxiv","version":1},"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"}