72 citations · 250 across the 57 of their papers we have counts for
6 papers · 1 filter
Algebraic matroids with graph symmetry
Franz J. Király, Zvi Rosen, Louis Theran
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example r…
Algorithms for detecting dependencies and rigid subsystems for CAD
James Farre, Helena Kleinschmidt, Jessica Sidman +4
Geometric constraint systems underly popular Computer Aided Design soft- ware. Automated approaches for detecting dependencies in a design are critical for developing robust solver…
Frameworks with forced symmetry II: Orientation-preserving crystallographic groups
Justin Malestein, Louis Theran
We give a combinatorial characterization of minimally rigid planar frameworks with orientation-preserving crystallographic symmetry, under the constraint of forced symmetry. The ma…
Frameworks with forced symmetry I: Reflections and rotations
Justin Malestein, Louis Theran
We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotat…
Obtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion
Franz J. Király, Louis Theran
We propose a general framework for reconstructing and denoising single entries of incomplete and noisy entries. We describe: effective algorithms for deciding if and entry can be r…
Coherence and sufficient sampling densities for reconstruction in compressed sensing
Franz J. Király, Louis Theran
We give a new, very general, formulation of the compressed sensing problem in terms of coordinate projections of an analytic variety, and derive sufficient sampling rates for signa…