90 citations · 119 across the 9 of their papers we have counts for
10 papers
Stability, corners, and other 2-dimensional shapes
Amador Martin-Pizarro, Daniel Palacin, Julia Wolf
We introduce a relaxation of stability, called almost sure stability, which is insensitive to perturbations by subsets of Loeb measure in a non-standard finite group. We show t…
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…
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…
Stable arithmetic regularity in the finite-field model
C. Terry, J. Wolf
The arithmetic regularity lemma for , proved by Green in 2005, states that given a subset , there exists a subspace $H\leq \mathbb{F}_p^n…
Szemerédi's theorem in the primes
Luka Rimanic, Julia Wolf
Green and Tao famously proved in 2005 that any subset of the primes of fixed positive density contains arbitrarily long arithmetic progressions. Green had previously shown that in…
Sampling-based proofs of almost-periodicity results and algorithmic applications
Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani +1
We give new combinatorial proofs of known almost-periodicity results for sumsets of sets with small doubling in the spirit of Croot and Sisask, whose almost-periodicity lemma has h…