English
Related papers

Related papers: New classes of matrix decompositions

200 papers

Invariance transformations of polyadic decompositions of matrix multiplication tensors define an equivalence relation on the set of such decompositions. In this paper, we present an algorithm to efficiently decide whether two polyadic…

Computational Complexity · Computer Science 2022-04-15 Guillaume O. Berger , P. -A. Absil , Lieven De Lathauwer , Raphaël M. Jungers , Marc Van Barel

We discuss a class of linear representations of the product poset of totally ordered sets $P= T_1 \times \cdots \times T_n$ which decompose into interval representations for block intervals. These can be characterised in terms of a…

Representation Theory · Mathematics 2024-06-05 Jan-Paul Lerch

In this work, new closed-form formulas for the matrix exponential are provided. Our method is direct and elementary, it gives tractable and manageable formulas not current in the extensive literature on this essential subject. Moreover,…

Rings and Algebras · Mathematics 2021-08-17 Mohammed Mouçouf , Said Zriaa

We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…

Combinatorics · Mathematics 2026-02-05 Gi-Sang Cheon , Hong Joon Choi , Gukwon Kwon , Hojoon Lee , Yaling Wang

We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.

Algebraic Geometry · Mathematics 2016-02-26 Rob Eggermont

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

Optimization and Control · Mathematics 2016-10-27 Sander Gribling , David de Laat , Monique Laurent

Correlation matrices (positive semidefinite matrices with ones on the diagonal) are of fundamental interest in quantum information theory. In this work we introduce and study the set of $r$-decomposable correlation matrices: those that can…

Quantum Physics · Physics 2020-12-01 Benjamin Lovitz

We construct real and complex matrices in terms of Kronecker products of a Witt basis of 2n null vectors in the geometric algebra over the real and complex numbers. In this basis, every matrix is represented by a unique sum of products of…

General Mathematics · Mathematics 2018-08-08 Garret Sobczyk

We consider the problem of decomposing a real-valued symmetric tensor as the sum of outer products of real-valued, pairwise orthogonal vectors. Such decompositions do not generally exist, but we show that some symmetric tensor decomposition…

Numerical Analysis · Mathematics 2015-03-05 Tamara G. Kolda

We propose a novel method of finding the classical limit of the matrix geometry. We define coherent states for a general matrix geometry described by a large-N sequence of D Hermitian matrices X_\mu (\mu =1,2, ..., D) and construct a…

High Energy Physics - Theory · Physics 2015-09-17 Goro Ishiki

In this paper, we introduce two new forms of the dual Hartwig-Spindelb{\"o}ck decomposition and employ them to derive explicit representations for several classes of dual generalized inverses. Building on these representations, we further…

Rings and Algebras · Mathematics 2026-02-10 Tan Mei , Kezheng Zuo , Hui Yan

In this survey paper we study parametric versions of writing a matrix in $SL_n (\mathbb{C})$ as a product of lower and upper unitriangular matrices in interchanging order as well as generalizations to other classical groups. We give an…

Complex Variables · Mathematics 2026-01-06 Gaofeng Huang , Frank Kutzschebauch

We show that a certain representation of the matrix-product can be computed with $n^{o(1)}$ multiplications. We also show, that siumilar representations of matrices can be compressed enormously.

Computational Complexity · Computer Science 2007-05-23 Vince Grolmusz

Low rank tensor decompositions are a powerful tool for learning generative models, and uniqueness results give them a significant advantage over matrix decomposition methods. However, tensors pose significant algorithmic challenges and…

Data Structures and Algorithms · Computer Science 2014-01-21 Aditya Bhaskara , Moses Charikar , Ankur Moitra , Aravindan Vijayaraghavan

We consider nonnegative r-potent matrices with finite dimensions and study their decomposability. We derive the precise conditions under which an r-potent matrix is decomposable. We further determine a general structure for the r-potent…

Functional Analysis · Mathematics 2015-04-20 Rashmi Sehgal Thukral , Alka Marwaha

We prove that every holomorphic symplectic matrix can be factorized as a product of holomorphic unitriangular matrices with respect to the symplectic form $ \left[\begin{array}{ccc} 0 & L_n \\ -L_n & 0\end{array}\right]$ where $L$ is the $n…

Complex Variables · Mathematics 2025-07-28 Gaofeng Huang , Frank Kutzschebauch , Phan Quoc Bao Tran

Chien, Liu, Nakazato, and Tam proved that all n by n classical Toeplitz matrices (one-level Toeplitz matrices) are unitarily similar to complex symmetric matrices via two types of unitary matrices and the type of the unitary matrices only…

Functional Analysis · Mathematics 2019-06-26 Lei Cao , Selcuk Koyuncu

Schur decompositions and the corresponding Schur forms of a single matrix, a pair of matrices, or a collection of matrices associated with the periodic eigenvalue problem are frequently used and studied. These forms are upper-triangular…

Combinatorics · Mathematics 2023-02-02 Andrii Dmytryshyn

The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…

Mathematical Physics · Physics 2025-10-16 Martin Roelfs , Steven De Keninck

We show that the set of $m \times m$ complex skew-symmetric matrix polynomials of odd grade $d$, i.e., of degree at most $d$, and (normal) rank at most $2r$ is the closure of the single set of matrix polynomials with the certain, explicitly…

Rings and Algebras · Mathematics 2017-03-20 Andrii Dmytryshyn , Froilan M. Dopico