5 papers
Quantitative analytic stable regularity
G. Conant, C. Terry
We prove quantitative stable regularity lemmas for binary real-valued functions, extending the work of Malliaris and Shelah for stable graphs. The statements of our results are mod…
Encoding orders and trees in real-valued functions
G Conant, C Terry
We prove function-theoretic analogues of a quantitative result of Hodges on extracting the order property from a sufficiently large 2-tree coded in a binary relation. Similar analo…
Higher-order generalizations of stability and arithmetic regularity
C. Terry, J. Wolf
We define a natural notion of higher order stability and show that subsets of that are tame in this sense can be approximately described by a union of low-complexi…
Higher arity stability and the functional order property
A. Abd-Aldaim, G. Conant, C. Terry
The -dimensional functional order property () is a combinatorial property of a -partitioned formula. This notion arose in work of Terry and Wolf, which iden…
Irregular triads in 3-uniform hypergraphs
C. Terry, J. Wolf
Over the past several years, numerous authors have explored model theoretically motivated combinatorial conditions that ensure that a graph has an efficient regular decomposition i…