Cameron E. Freer

most citedStable regularity for relational structures

4 citations · 5 across the 3 of their papers we have counts for

collaborators

3 papers

math.LO2018★ 4 cited

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…

math.LO2017★ 1 cited

Properly ergodic structures

Nathanael Ackerman, Cameron Freer, Alex Kruckman +1

We consider ergodic $Sym (N)$ -invariant probability measures on the space of $L$ -structures with domain $N$ (for $L$ a countable relational language), and…

math.LO2017

Countable infinitary theories admitting an invariant measure

Nathanael Ackerman, Cameron Freer, Rehana Patel

Let $L$ be a countable language. We characterize, in terms of definable closure, those countable theories $Σ$ of $L_{ω_{1}, ω} (L)$ for which there exists an $S_{\infty}$ -inva…