Publications (18)
Partial associativity and rough approximate groups
W. T. Gowers, Jason Long
Suppose that a binary operation on a finite set is injective in each variable separately and also associative. It is easy to prove that must be a group. In…
A note on the Brown--ErdÅs--Sós conjecture in groups
Jason Long
We show that a dense subset of a sufficiently large group multiplication table contains either a large part of the addition table of the integers modulo some , or the entire mul…
The largest projective cube-free subsets of
Jason Long, Adam Zsolt Wagner
In the Boolean lattice, Sperner's, ErdÅs's, Kleitman's and Samotij's theorems state that families that do not contain many chains must have a very specific layered structure. We s…
Robust Counterfactual Explanations for Tree-Based Ensembles
Sanghamitra Dutta, Jason Long, Saumitra Mishra +2
Counterfactual explanations inform ways to achieve a desired outcome from a machine learning model. However, such explanations are not robust to certain real-world changes in the u…
The extremal number of Venn diagrams
Peter Keevash, Imre Leader, Jason Long +1
We show that there exists an absolute constant such that any family of size at least has dual VC-dimension at least 3. Equivalently, eve…
Linear characters of Sylow subgroups of symmetric groups
Eugenio Giannelli, Stacey Law, Jason Long
Let be any prime. Let be a Sylow -subgroup of the symmetric group . Let and be linear characters of and let be the normaliser of in $S_n…