72 citations · 250 across the 57 of their papers we have counts for
4 papers · 1 filter
The Algebraic Combinatorial Approach for Low-Rank Matrix Completion
Franz J. Király, Louis Theran, Ryota Tomioka
We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theor…
Henneberg constructions and covers of cone-Laman graphs
Louis Theran
We give Henneberg-type constructions for three families of sparse colored graphs arising in the rigidity theory of periodic and other forced symmetric frameworks. The proof method,…
Generic rigidity of reflection frameworks
Justin Malestein, Louis Theran
We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that on…
Generic rigidity with forced symmetry and sparse colored graphs
Justin Malestein, Louis Theran
We review some recent results in the generic rigidity theory of planar frameworks with forced symmetry, giving a uniform treatment to the topic. We also give new combinatorial char…