Related papers: On Vertically-Recurrent Matrices and Their Algebra…

This short note, in part of expository nature, points out several new or recent consequences of a quite nice decomposition for positive semi-definite matrices.

For any essentially small triangulated category the centre of its lattice of thick subcategories is introduced; it is a spatial frame and yields a notion of central support. A relative version of this centre recovers the support theory for…

In 1954, Alston S. Householder published \textit{Principles of Numerical Analysis}, one of the first modern treatments on matrix decomposition that favored a (block) LU decomposition-the factorization of a matrix into the product of lower…

For $n\ge 2$ and fixed $k\ge 1$, we study when a square matrix $A$ over an arbitrary field $\mathbb{F}$ can be decomposed as $T+N$ where $T$ is a torsion matrix and $N$ is a nilpotent matrix with $N^k=0$. For fields of prime characteristic,…

We revisit a formula that connects the minimal ranks of triangular parts of a matrix and its inverse and relate the result to structured rank matrices. We also address the generic minimal rank problem.

In this paper, we introduce a new generalization of Pascal's triangle. The new object is called the hyperbolic Pascal triangle since the mathematical background goes back to regular mosaics on the hyperbolic plane. We describe precisely the…

Polar decompositions of quaternion matrices with respect to a given indefinite inner product are studied. Necessary and sufficient conditions for the existence of an $H$-polar decomposition are found. In the process an equivalent to Witt's…

We propose a functional view of matrix decomposition problems on graphs such as geometric matrix completion and graph regularized dimensionality reduction. Our unifying framework is based on the key idea that using a reduced basis to…

We follow a stream of the history of positive matrices and positive functionals, as applied to algebraic sums of squares decompositions, with emphasis on the interaction between classical moment problems, function theory of one or several…

We define and characterize the $\gamma$-matrix associated to Pascal-like matrices that are defined by ordinary and exponential Riordan arrays. We also define and characterize the $\gamma$-matrix of the reversions of these triangles, in the…

The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of…

The present article studies decompositions of vector bundles on the moduli stack of elliptic curves that are pushforwards of vector bundles on moduli of elliptic curves with level structure. These imply decomposition results for rings of…

The concept of descent algebras over a field of characteristic zero is extended to define descent algebras over a field of prime characteristic. Some basic algebraic structure of the latter, including its radical and irreducible modules, is…

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…

In the context of complex algebraic varieties, the decomposition theorem for semi-small maps provides a decomposition of the direct image of the constant sheaf. In this work, we develop a decomposition theorem for branched coverings of…

While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…

We make a full landscape analysis of the (generally non-convex) orthogonal Procrustes problem. This problem is equivalent to computing the polar factor of a square matrix. We reveal a convexity-like structure, which explains the already…

If V(R) is the vertex set of a symmetric cycle R in the tope graph of a simple oriented matroid M, then for any tope T of M there exists a unique inclusion-minimal subset Q(T,R) of V(R) such that T is the sum of the topes of Q(T,R). If for…

This paper proposes a novel matrix rank-one decomposition for quaternion Hermitian matrices, which admits a stronger property than the previous results in (sturm2003cones,huang2007complex,ai2011new). The enhanced property can be used to…

We develop tractable convex relaxations for rank-constrained quadratic optimization problems over $n \times m$ matrices, a setting for which tractable relaxations are typically only available when the objective or constraints admit spectral…