2 citations · 3 across the 9 of their papers we have counts for
4 papers · 1 filter
On subsets of the hypercube with prescribed Hamming distances
Hao Huang, Oleksiy Klurman, Cosmin Pohoata
A celebrated theorem of Kleitman in extremal combinatorics states that a collection of binary vectors in with diameter has cardinality at most that of a Hamming ba…
Local Properties via Color Energy Graphs and Forbidden Configurations
Sara Fish, Cosmin Pohoata, Adam Sheffer
The local properties problem of Erdős and Shelah generalizes many Ramsey problems and some distinct distances problems. In this work, we derive a variety of new bounds for the loca…
Local Properties in Colored Graphs, Distinct Distances, and Difference Sets
Cosmin Pohoata, Adam Sheffer
We study Extremal Combinatorics problems where local properties are used to derive global properties. That is, we consider a given configuration where every small piece of the conf…
Improved Bounds for Progression-Free Sets in
Fedor Petrov, Cosmin Pohoata
Let be a finite group, and let represent the size of the largest subset of without non-trivial three-term progressions. In a recent breakthrough, Croot, Lev and…