Related papers: Recent Progress on Matrix Rigidity -- A Survey
We develop a rigidity theory for frameworks in $\mathbb{R}^3$ which have two coincident points but are otherwise generic and only infinitesimal motions which are tangential to a family of cylinders induced by the realisation are considered.…
Given a distance matrix $D$, we study the behavior of its compaction vector and reduction matrix with respect to the problem of the realization of $D$ by a weighted graph. To this end, we first give a general result on realization by…
The matrix completion problem aims to reconstruct a low-rank matrix based on a revealed set of possibly noisy entries. Prior works consider completing the entire matrix with generalization error guarantees. However, the completion accuracy…
We establish the $\#P$-hardness of computing a broad class of immanants, even when restricted to specific categories of matrices. Concretely, we prove that computing $\lambda$-immanants of $0$-$1$ matrices is $\#P$-hard whenever the…
Let $R$ be a ring with unity, $\sigma$ an endomorphism of $R$ and $M_R$ a right $R$-module. In this paper, we continue studding $\sigma$-rigid modules that were introduced by Gunner et al. \cite{generalized/rigid}. We give some results on…
Dimensionality reduction is a popular approach to tackle high-dimensional data with low-dimensional nature. Subspace Restricted Isometry Property, a newly-proposed concept, has proved to be a useful tool in analyzing the effect of…
In this paper, we study the class of relatively $D$-stable matrices and provide the conditions, sufficient for relative $D$-stability. We generalize the well-known Hadamard inequality, to provide upper bounds for the determinants of…
In this paper, we introduce new concepts of weak rigidity matrix and infinitesimal weak rigidity for planar frameworks. The weak rigidity matrix is used to directly check if a framework is infinitesimally weakly rigid while previous work…
In the context of nanowire heterostructures we perform a discrete to continuum limit of the corresponding free energy by means of $\Gamma$-convergence techniques. Nearest neighbours are identified by employing the notions of Voronoi…
This paper presents an alternative approach to the study of distance rigidity in networks of mobile agents, based on a subframework scheme. The advantage of the proposed strategy lies in expressing framework rigidity, which is inherently…
Matroid varieties are the closures in the Grassmannian of sets of points defined by specifying which Pl\"ucker coordinates vanish and which don't --- the set of nonvanishing Pl\"ucker coordinates forms a well-studied object called a…
We study the problem of learning a structured approximation (low-rank, sparse, banded, etc.) to an unknown matrix $A$ given access to matrix-vector product (matvec) queries of the form $x \rightarrow Ax$ and $x \rightarrow A^Tx$. This…
The notion of `stable rank' of a matrix is central to the analysis of randomized matrix algorithms, covariance estimation, deep neural networks, and recommender systems. We compare the properties of the stable rank and intrinsic dimension…
The paper presents a systematic approach for stiffness modeling of manipulators with complex and hybrid structures using matrix structural analysis. In contrast to previous results, it is suitable for mixed architectures containing…
Inspired by a recent result of Brakensiek et al. that symmetric tensor matroids and rigidity matroids are linked by matroid duality, we define abstract symmetric tensor matroids as a dual concept to abstract rigidity matroids and establish…
A new matrix product, called the semi-tensor product (STP), is briefly reviewed. The STP extends the classical matrix product to two arbitrary matrices. Under STP the set of matrices becomes a monoid (semi-group with identity). Some related…
We investigate extremal metrics at which various types of rigidity theorems involving scalar curvatures hold. The rigidity we discuss here is related to the rigidity theorems presented by Mario Listing in his previous preprint. More…
Robust disturbance rejection remains a longstanding challenge in humanoid locomotion, particularly on unstructured terrains where sensing is unreliable and model mismatch is pronounced. While perception information, such as height map,…
A bar-joint framework $(G,p)$ in Euclidean $d$-space is rigid if the only edge-length-preserving continuous motions arise from isometries of $\mathbb{R}^d$. In the generic case, rigidity is determined by the generic $d$-dimensional rigidity…
The purpose of this text is to provide an accessible introduction to a set of recently developed algorithms for factorizing matrices. These new algorithms attain high practical speed by reducing the dimensionality of intermediate…