2 citations · 3 across the 4 of their papers we have counts for
4 papers
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 represents the rating of movie by customer , if customer $…
Cycles in graphs and in hypergraphs: results and problems
E. Alkin, S. Dzhenzher, O. Nikitenko +2
This is an expository paper. A -cycle in a graph is a set of edges such that every vertex is contained in an even number of edges from . E.g., a cycle in the sense of gra…
A quadratic estimation for the Kühnel conjecture on embeddings
S. Dzhenzher, A. Skopenkov
The classical Heawood inequality states that if the complete graph on vertices is embeddable in the sphere with handles, then . A higher-…
A structured proof of Kolmogorov's Superposition Theorem
S. Dzhenzher, A. Skopenkov
We present a well-structured detailed exposition of a well-known proof of the following celebrated result solving Hilbert's 13th problem on superpositions. For functions of 2 varia…