{"paper":{"title":"A recursive construction of t-wise uniform permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Hilary Finucane, Ron Peled, Yariv Yaari","submitted_at":"2012-01-24T12:16:59Z","abstract_excerpt":"We present a recursive construction of a (2t + 1)-wise uniform set of permutations on 2n objects using a (2t + 1) - (2n, n, \\cdot) combinatorial design, a t-wise uniform set of permutations on n objects and a (2t+1)-wise uniform set of permutations on n objects. Using the complete design in this procedure gives a t-wise uniform set of permutations on n objects whose size is at most t^2n, the first non-trivial construction of an infinite family of t-wise uniform sets for t \\geq 4. If a non-trivial design with suitable parameters is found, it will imply a corresponding improvement in the constru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4960","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"}