Finding one excellent element in case of one lie
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912490696212480 |
|---|---|
| author | Gupta, Aanchal Katona, Gyula O. H. |
| author_facet | Gupta, Aanchal Katona, Gyula O. H. |
| contents | An n-element set contains an unknown number of excellent elements, and our goal is to identify at least one of these elements. The members of a family of subsets can be asked if they contain at least one excellent element or not. At most one of the answers can be wrong. We find the smallest family that finds one excellent element or claims that there is none. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_13948 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Finding one excellent element in case of one lie Gupta, Aanchal Katona, Gyula O. H. Combinatorics 05D05 An n-element set contains an unknown number of excellent elements, and our goal is to identify at least one of these elements. The members of a family of subsets can be asked if they contain at least one excellent element or not. At most one of the answers can be wrong. We find the smallest family that finds one excellent element or claims that there is none. |
| title | Finding one excellent element in case of one lie |
| topic | Combinatorics 05D05 |
| url | https://arxiv.org/abs/2507.13948 |