Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.09304 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929343917195264 |
|---|---|
| author | Shen, Alexander |
| author_facet | Shen, Alexander |
| contents | Kolmogorov complexity is often used as a convenient language for counting and/or probabilistic existence proofs. However, there are some applications where Kolmogorov complexity is used in a more subtle way. We provide one (somehow) surprising example where an existence of a winning strategy in a natural combinatorial game is proven (and no direct proof is known). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_09304 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Kolmogorov complexity as a combinatorial tool Shen, Alexander Discrete Mathematics Information Theory Combinatorics 68Q87 F.1.2 Kolmogorov complexity is often used as a convenient language for counting and/or probabilistic existence proofs. However, there are some applications where Kolmogorov complexity is used in a more subtle way. We provide one (somehow) surprising example where an existence of a winning strategy in a natural combinatorial game is proven (and no direct proof is known). |
| title | Kolmogorov complexity as a combinatorial tool |
| topic | Discrete Mathematics Information Theory Combinatorics 68Q87 F.1.2 |
| url | https://arxiv.org/abs/2405.09304 |