Computability of Countable Sunflowers
Logic
2023-11-22 v1 Combinatorics
Abstract
We provide a characterization of when a countably infinite set of finite sets contains an infinite sunflower. We also show that the collection of such sets is Turing equivalent to the set of programs such that whenever the program converges it returns the code of a program with finite range.
Keywords
Cite
@article{arxiv.2311.12705,
title = {Computability of Countable Sunflowers},
author = {Nathanael Ackerman and Leah Karker and Mostafa Mirabi},
journal= {arXiv preprint arXiv:2311.12705},
year = {2023}
}