In this work we prove that, given a simplicial graph Γ $\Gamma$ and family G $\mathcal {G}$ of linear groups over domain R $R$ , the product $\Gamma \mathcal is [ t ̲ ] $R[\underline{t}]$ where $\underline{t}$ tuple finitely many linearly independent variables. As consequence, obtain that any complex numbers again group numbers. This solves an open problem Hsu Wise (Michigan Math. J. 46 (1999), ...

Obtaining a good similarity matrix is extremely important in subspace clustering. Current state-of-the-art methods learn the through self-expressive strategy. However, these directly adopt original samples as set of basis to represent itself linearly. It difficult accurately describe linear relation between real-world applications, and thus hard find an ideal matrix. To better samples, we prese...