2 citations · 2 across the 2 of their papers we have counts for
14 papers · 1 filter
Constructions in combinatorics via neural networks
Adam Zsolt Wagner
We demonstrate how by using a reinforcement learning algorithm, the deep cross-entropy method, one can find explicit constructions and counterexamples to several open conjectures i…
Infinite Sperner's theorem
Benny Sudakov, István Tomon, Adam Zsolt Wagner
One of the most classical results in extremal set theory is Sperner's theorem, which says that the largest antichain in the Boolean lattice has size $Θ\big(\frac{2^n}{\sq…
Uniform chain decompositions and applications
Benny Sudakov, Istvan Tomon, Adam Zsolt Wagner
The Boolean lattice is the family of all subsets of ordered by inclusion, and a chain is a family of pairwise comparable elements of . Let $s…
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…
Bounded Degree Spanners of the Hypercube
Rajko Nenadov, Mehtaab Sawhney, Benny Sudakov +1
In this short note we study two questions about the existence of subgraphs of the hypercube with certain properties. The first question, due to Erdős--Hamburger--Pippert--Wea…
The performance guarantee of randomized perfect voting trees
Jason Long, Adam Zsolt Wagner
In this note we study randomized voting trees, previously introduced by Fisher, Procaccia and Samorodnitsky. They speculate that a non-trivial performance guarantee may be achievab…