5 papers
Set-defined graph classes: -boundedness meets tropical algebra
Sarosh Adenwalla, Samuel Braunfeld, Tomáš Hons +2
We study set-defined graph classes: hereditary classes whose vertices are assigned fixed-length numerical tuples, with adjacency determined solely by equality patterns among coordi…
Modeling FO-limits for monadically stable sequences
S. Braunfeld, J. NeÅ¡etÅil, P. Ossona de Mendez
We show that given a monadically stable theory , a sufficiently saturated , and a coherent system of probability measures on the -algebras generated by…
Separability Properties of Monadically Dependent Graph Classes
Ãdouard Bonnet, Samuel Braunfeld, Ioannis Eleftheriadis +5
A graph class is monadically dependent if one cannot interpret all graphs in colored graphs from using a fixed first-order interpretation. We prove that m…
When invariance implies exchangeability (and applications to invariant Keisler measures)
Samuel Braunfeld, Colin Jahel, Paolo Marimon
We study the problem of when, given a countable homogeneous structure and a space of expansions of , every -invariant probability measure on is exch…
Boolean combinations of graphs
Sarosh Adenwalla, Samuel Braunfeld, John Sylvester +1
Boolean combinations allow combining given combinatorial objects to obtain new, potentially more complicated, objects. In this paper, we initiate a systematic study of this idea ap…