4 citations · 11 across the 15 of their papers we have counts for
4 papers · 2 filters
The entropy function of an invariant measure
Nathanael Ackerman, Cameron Freer, Rehana Patel
Given a countable relational language , we consider probability measures on the space of -structures with underlying set that are invariant under the logic actio…
Categoricity in multiuniversal classes
Nathanael Ackerman, Will Boney, Sebastien Vasey
The third author has shown that Shelah's eventual categoricity conjecture holds in universal classes: class of structures closed under isomorphisms, substructures, and unions of ch…
On the computability of graphons
Nathanael L. Ackerman, Jeremy Avigad, Cameron E. Freer +2
We investigate the relative computability of exchangeable binary relational data when presented in terms of the distribution of an invariant measure on graphs, or as a graphon in e…
Stable regularity for relational structures
Nathanael Ackerman, Cameron Freer, Rehana Patel
We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that unde…