Related papers: Unique Matrix Factorizations associated to Bilinea…

We extend the $\lambda$-theory of operator spaces given by Defant and Wiesner (2014), that generalizes the notion of the projective, Haagerup and Schur tensor norm for operator spaces to matrix ordered spaces and Banach $*$-algebras. Given…

For a self-adjoint unbounded operator D on a Hilbert space H, a bounded operator y on H and some complex Borel functions g(t) we establish inequalities of the type ||[g(D),y]|| \leq A|||y|| + B||[D,y]|| + ...+ X|[D, [D,...[D, y]...]]||. The…

We observe that there is an equivalence between the singularity category of an affine complete intersection and the homotopy category of matrix factorizations over a related scheme. This relies in part on a theorem of Orlov. Using this…

We consider the factorization of a rectangular matrix $X $ into a positive linear combination of rank-one factors of the form $u v^\top$, where $u$ and $v$ belongs to certain sets $\mathcal{U}$ and $\mathcal{V}$, that may encode specific…

To a graded finite-rank matrix factorisation of the difference of two homogeneous potentials one can assign two numbers, the left and right quantum dimension. The existence of such a matrix factorisation with non-zero quantum dimensions…

Using five basic principles we treat Gerstenhaber/Lie brackets, BV operators and Master equations appearing in mathematical and physical contexts in a unified way. The different contexts for this are given by the different types of…

We announce recent results on a connection between factorization statistics of polynomials over a finite field and the structure of the cohomology of configurations in $\mathbb{R}^3$ as a representation of the symmetric group. This…

General approach to the multiplication or adjoint operation of $2\times 2$ block operator matrices with unbounded entries are founded. Furthermore, criteria for self-adjointness of block operator matrices based on their entry operators are…

Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the integrality gap between two optimization problems: a…

We initiate the study of factorization centers of birational maps, and complete it for surfaces over a perfect field in this article. We prove that for every birational automorphism $\phi : X \dashrightarrow X$ of a smooth projective…

This article characterizes the rank-one factorization of auto-correlation matrix polynomials. We establish a sufficient and necessary uniqueness condition for uniqueness of the factorization based on the greatest common divisor (GCD) of…

We will use commutators to provide decompositions of $3\times 3$ matrices as sums whose terms satisfy some polynomial identities, and we apply them to bounded linear operators and endomorphisms of free modules of infinite rank. In…

We prove that linearizing certain families of polynomial optimization problems leads to new functorial operations in real convex sets. We show that under some conditions these operations can be computed or approximated in ways amenable to…

The main purpose of this paper is the study of a~new class of summing multilinear operators acting from the product of Banach lattices with some nontrivial lattice convexity. A~mixed Pietsch-Maurey-Rosenthal type factorization theorem for…

We study a factorization of bounded linear maps from an operator space $A$ to its dual space $A^*$. It is shown that $T : A \longrightarrow A^*$ factors through a pair of a column Hilbert spaces $\mathcal{H}_c$ and its dual space if and…

Given a fixed matrix, the problem of column subset selection requests a column submatrix that has favorable spectral properties. Most research from the algorithms and numerical linear algebra communities focuses on a variant called…

Fast transforms correspond to factorizations of the form $\mathbf{Z} = \mathbf{X}^{(1)} \ldots \mathbf{X}^{(J)}$, where each factor $ \mathbf{X}^{(\ell)}$ is sparse and possibly structured. This paper investigates essential uniqueness of…

Sparse matrix factorization is the problem of approximating a matrix $\mathbf{Z}$ by a product of $J$ sparse factors $\mathbf{X}^{(J)} \mathbf{X}^{(J-1)} \ldots \mathbf{X}^{(1)}$. This paper focuses on identifiability issues that appear in…

We lay out an infinity categorical interpretation of reconstruction theorems which are germane to the symmetric monoidal perspective of noncommutative algebraic geometry, present sufficient conditions which allow for the factorization of…

We prove bilinear inequalities for differential operators in $\mathbb{R}^2$. Such type inequalities turned out to be useful for anisotropic embedding theorems for overdetermined systems and the limiting order summation exponent. However,…