Kolmogorov complexity as a combinatorial tool
Discrete Mathematics
2024-05-16 v1 Information Theory
Combinatorics
math.IT
Abstract
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).
Cite
@article{arxiv.2405.09304,
title = {Kolmogorov complexity as a combinatorial tool},
author = {Alexander Shen},
journal= {arXiv preprint arXiv:2405.09304},
year = {2024}
}
Comments
Prepared as an special session invited talk at CiE 2024