1 citations · 1 across the 12 of their papers we have counts for
5 papers · 1 filter
Nonlinear lower-tail large deviations at criticality
Matthew Kwan, Huy Tuan Pham
We introduce general methods to derive lower tail large deviation principles, for a variety of nonlinear problems of combinatorial interest. These methods are especially effective…
Three trees suffice for a constant stretch in minor-free graphs
Hung Le, Huy Pham, Cuong Than +1
In this short note, we show that -minor-free graphs have a tree cover with trees and constant stretch for any fixed graph . The number of trees matches the recent lower b…
No--in-line problem for
Anubhab Ghosal, Ritesh Goenka, Alexandr Grebennikov +3
What is the maximum number of points one can place in an grid such that every Euclidean line contains at most points? For , this is the notorious no-three-i…
A note on arithmetic progressions with restricted differences
David Conlon, Jacob Fox, Huy Tuan Pham
In this note, we show how to adapt Tao's slice rank method to extend the Ellenberg--Gijswijt theorem on cap sets to the problem of forbidding arithmetic progressions with restricte…
A Fast Hierarchical Splitting Approach for Non-Adaptive Learning of Random Hypergraphs
Huy Pham, Hoang Ta
This work focuses on the problem of learning an unknown -uniform hypergraph using edge-detecting queries. Our goal is to design a querying strategy that recovers the hyperedge s…