S. Dzhenzher

collaborators

3 papers

math.CO2025

A quadratic estimation for the KÃ¼hnel conjecture on embeddings

S. Dzhenzher, A. Skopenkov

The classical Heawood inequality states that if the complete graph $K_{n}$ on $n$ vertices is embeddable in the sphere with $g$ handles, then $g \geq \frac{( n - 3 ) ( n - 4 )}{12}$ . A higher-…

math.HO2025

Low rank matrix completion and realization of graphs: results and problems

S. Dzhenzher, T. Garaev, O. Nikitenko +3

The Netflix problem (from machine learning) asks the following. Given a ratings matrix in which each entry $(i, j)$ represents the rating of movie $j$ by customer $i$ , if customer $…

math.HO2024

Cycles in graphs and in hypergraphs: results and problems

E. Alkin, S. Dzhenzher, O. Nikitenko +2

This is an expository paper. A $1$ -cycle in a graph is a set $C$ of edges such that every vertex is contained in an even number of edges from $C$ . E.g., a cycle in the sense of gra…