HackerPapers

arXiv:2307.12430math.CO

Applying constraint programming to minimal lottery designs

David Cushing, David I. Stewart

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

We develop and deploy a set of constraints for the purpose of calculating minimal sizes of lottery designs. Specifically, we find the minimum number of tickets of size six which are needed to match at least two balls on any draw of size six, whenever there are at most 70 balls.

arXiv comments
21 pages; to appear in Constraints
Journal reference
DOI
Subjects
math.COCombinatorics cs.DMDiscrete Mathematics

On Hacker News

No comments linking this paper were found in the collected sources. Found in 3 HN submissions from Jul 2023 to Aug 2023. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.