Applying constraint programming to minimal lottery designs
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917695590498304 |
|---|---|
| author | Cushing, David Stewart, David I. |
| author_facet | Cushing, David Stewart, David I. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2307_12430 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Applying constraint programming to minimal lottery designs Cushing, David Stewart, David I. Combinatorics Discrete Mathematics 05B30, 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. |
| title | Applying constraint programming to minimal lottery designs |
| topic | Combinatorics Discrete Mathematics 05B30, |
| url | https://arxiv.org/abs/2307.12430 |