4 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.DM2016★ 4 cited
Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method
Avi Levy, Harishchandra Ramadas, Thomas Rothvoss
A well-known theorem of Spencer shows that any set system with sets over elements admits a coloring of discrepancy . While the original proof was non-construct…
math.PR2016
Ewens sampling and invariable generation
Gerandy Brito, Christopher Fowler, Matthew Junge +1
We study the number of random permutations needed to invariably generate the symmetric group, , when the distribution of cycle counts has the strong -logarithmic property.…
math.CO2014
A 3-to-1 cactus graph: Details
Avi Levy
We briefly present a new construction of a 3-to-1 unrecoverable electrical network. This is a taste of a comprehensive forthcoming paper on unrecoverable electrical networks.