Higher arity stability and the functional order property
A. Abd-Aldaim, G. Conant, C. Terry

TL;DR
This paper explores the higher arity functional order property ($ ext{FOP}_k$), establishing its implications in model theory, providing new characterizations, and applying these results to algebraic structures like vector spaces with bilinear forms.
Contribution
It introduces new characterizations of $ ext{NFOP}_k$, demonstrates closure properties, and applies the theory to algebraic examples, advancing the understanding of higher arity stability concepts.
Findings
$ ext{NFOP}_k$ is closed under Boolean combinations.
$ ext{FOP}_k$ can be witnessed with formulas where all but one variable are of length 1.
Infinite dimensional vector space theories are $ ext{NFOP}_2$ iff the field is stable.
Abstract
The -dimensional functional order property () is a combinatorial property of a -partitioned formula. This notion arose in work of Terry and Wolf, which identified as a ternary analogue of stability in the context of two finitary combinatorial problems related to hypergraph regularity and arithmetic regularity. In this paper we show has equally strong implications in model-theoretic classification theory, where its behavior as a -ary version of stability is in close analogy to the behavior of -dependence as a -ary version of . Our results include several new characterizations of , including a characterization in terms of collapsing indiscernibles, combinatorial recharacterizations, and a characterization in terms of type-counting when . As a corollary of our collapsing theorem, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory · Advanced Graph Theory Research
