2 citations · 2 across the 6 of their papers we have counts for
6 papers
A note on directed analogues of the Sidorenko and forcing conjectures
Jacob Fox, Zoe Himwich, Nitya Mani +1
We study analogues of Sidorenko's conjecture and the forcing conjecture in oriented graphs, showing that natural variants of these conjectures in directed graphs are equivalent to…
Small subsets with large sumset: Beyond the Cauchy--Davenport bound
Jacob Fox, Sammy Luo, Huy Tuan Pham +1
For a subset of an abelian group , given its size , its doubling , and a parameter which is small compared to , we study the size of the largest s…
On product sets of arithmetic progressions
Max Wenqiang Xu, Yunkun Zhou
We prove that the size of the product set of any finite arithmetic progression satisfies \[|\mathcal A \cdot \mathcal A| \ge \frac{|\mathcal A|^2}{(…
Discrepancy of arithmetic progressions in grids
Jacob Fox, Max Wenqiang Xu, Yunkun Zhou
We prove that the the discrepancy of arithmetic progressions in the -dimensional grid is within a constant factor depending only on of $N^{\frac{d}{2d+2}…
Discrepancy in modular arithmetic progressions
Jacob Fox, Max Wenqiang Xu, Yunkun Zhou
Celebrated theorems of Roth and of Matoušek and Spencer together show that the discrepancy of arithmetic progressions in the first positive integers is . We study t…
Impartial digraphs
Yufei Zhao, Yunkun Zhou
We prove a conjecture of Fox, Huang, and Lee that characterizes directed graphs that have constant density in all tournaments: they are disjoint unions of trees that are each const…