{"paper":{"title":"A van der Corput-type algorithm for LS-sequences of points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Ingrid Carbone","submitted_at":"2012-09-17T09:47:23Z","abstract_excerpt":"In this paper we associate to any $LS$-sequence of partitions ${\\rho_{L,S}^n}$ the corresponding $LS$-sequence of points ${\\xi_{L,S}^n}$ obtained reordering the points of each partition with an explicit algorithm. The procedure begins with the representation in base $L+S$ of natural numbers, $[n]_{L+S}$, and ends with the $LS$-radical inverse function $\\phi_{L,S}$, introduced ad hoc, evaluated at an appropriate subsequence of natural numbers depending on $L$ and $S$. This construction is deeply related to the geometric representation of the points of ${\\xi_{L,S}^n}$ by suitable affine function"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3611","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"}