Dmitriy Kunisky

activity

20182025

most citedSpectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs

13 citations · 19 across the 11 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2025

The Lovász number of random circulant graphs

Afonso S. Bandeira, Jarosław Błasiok, Daniil Dmitriev +3

This paper addresses the behavior of the Lovász number for dense random circulant graphs. The Lovász number is a well-known semidefinite programming upper bound on the independence…

math.CO2021

The discrepancy of unsatisfiable matrices and a lower bound for the Komlós conjecture constant

Dmitriy Kunisky

We construct simple, explicit matrices with columns having unit $ℓ^{2}$ norm and discrepancy approaching $1 + 2 \approx 2.414$ . This number gives a lower bound, the stronge…