1 citations · 2 across the 30 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.CO2023
Matrix discrepancy and the log-rank conjecture
Benny Sudakov, István Tomon
Given an binary matrix with (where denotes the number of 1 entries), define the discrepancy of as $\mbox{disc}(M)=\displaystyle\max_{X\sub…
math.CO2023★ 1 cited
Note on the second eigenvalue of regular graphs
Igor Balla, Eero Räty, Benny Sudakov +1
The goal of this expository note is to give a short, self-contained proof of nearly optimal lower bounds for the second largest eigenvalue of the adjacency matrix of regular graphs…