Strongly n-distal NIP theories admit a hypergraph regularity lemma, compact domination for definable fsg groups, and the n-distality hierarchy is strict among stable theories; infinite such fields have characteristic zero.
Separating deterministic from randomized multiparty communication complexity.Theory of Computing, 6(1):201–225, 2010
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On n-distality, n-triviality and hypergraph regularity in NIP theories
Strongly n-distal NIP theories admit a hypergraph regularity lemma, compact domination for definable fsg groups, and the n-distality hierarchy is strict among stable theories; infinite such fields have characteristic zero.