Konstantin Golubev

collaborators

3 papers

math.CO2019

High dimensional Hoffman bound and applications in extremal combinatorics

Yuval Filmus, Konstantin Golubev, Noam Lifshitz

One powerful method for upper-bounding the largest independent set in a graph is the Hoffman bound, which gives an upper bound on the largest independent set of a graph in terms of…

math.CO2019

On the support of a non-autocorrelated function on a hyperbolic surface

Konstantin Golubev

Let $f$ be a non-negative square-integrable function on a finite volume hyperbolic surface $Γ\ H$ , and assume that $f$ is non-autocorrelated, that is, perpendicula…

cs.CC2019

Direct Sum Testing: The General Case

Irit Dinur, Konstantin Golubev

A function $f : [n_{1}] \times \dots \times [n_{d}] \to F_{2}$ is a direct sum if it is of the form $f (a_{1}, \dots, a_{d}) = f_{1} (a_{1}) \oplus \dots \oplus f_{d} (a_{d}),$ for some $d$ fu…