8 citations · 8 across the 3 of their papers we have counts for
3 papers
math.LO2023
Computability of Countable Sunflowers
Nathanael Ackerman, Leah Karker, Mostafa Mirabi
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…
math.CO2023
Algebraic Sunflowers
Nathanael Ackerman, Mostafa Mirabi
We study sunflowers within the context of finitely generated substructures of ultrahomogeneous structures. In particular, we look at bounds on how large a set system is needed to g…
math.ST2014★ 8 cited
An iterative step-function estimator for graphons
Diana Cai, Nathanael Ackerman, Cameron Freer
Exchangeable graphs arise via a sampling procedure from measurable functions known as graphons. A natural estimation problem is how well we can recover a graphon given a single gra…