Related papers: Norm optimal factorizations of scalar and block ma…

It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…

We develop refined Strichartz estimates at $L^2$ regularity for a class of time-dependent Schr\"{o}dinger operators. Such refinements begin to characterize the near-optimizers of the Strichartz estimate, and play a pivotal part in the…

Given an operator system $\mathcal{S}$, we define the parameters $r_k(\mathcal{S})$ (resp. $d_k(\mathcal{S})$) defined as the maximal value of the completely bounded norm of a unital $k$-positive map from an arbitrary operator system into…

Determinant maximization problem gives a general framework that models problems arising in as diverse fields as statistics \cite{pukelsheim2006optimal}, convex geometry \cite{Khachiyan1996}, fair allocations\linebreak \cite{anari2016nash},…

In this article, we discuss some applications of the well-known Douglas factorization lemma in the context of von Neumann algebras. Let $\mathcal{B}(\mathscr{H})$ denote the set of bounded operators on a complex Hilbert space $\mathscr{H}$,…

Given a positive definite matrix $A\in \mathbb{C}^{n\times n}$ and a Hermitian matrix $D\in \mathbb{C}^{m\times m}$, we characterize under which conditions there exists a strictly contractive matrix $K\in \mathbb{C}^{n\times m}$ such that…

We introduce multidimensional Schur multipliers and characterise them generalising well known results by Grothendieck and Peller. We define a multidimensional version of the two dimensional operator multipliers studied recently by Kissin…

The principal aim of this note is to illustrate how factorizations of singular, even-order partial differential operators yield an elementary approach to classical inequalities of Hardy-Rellich-type. More precisly, introducing the…

Factorial Schur functions are generalizations of Schur functions that have, in addition to the usual variables, a second family of "shift" parameters. We show that a factorial Schur function times a deformation of the Weyl denominator may…

Here, we give an algorithm for deciding if the nonnegative rank of a matrix $M$ of dimension $m \times n$ is at most $r$ which runs in time $(nm)^{O(r^2)}$. This is the first exact algorithm that runs in time singly-exponential in $r$. This…

We show that a bilinear radial Fourier multiplier operator with symbol $\sigma$ is $L^2(\R^n)\times L^2(\R^n) \to L^1(\R^n)$ bounded, $n\in \mathbb N,$ if the function $\sigma$ satisfies the smoothness condition $\sigma(2^j\cdot)\Phi\in…

Let X be a Hilbert bimodule over a C*-algebra A and $O_X= A \rtimes_X \Z$. Using a finite section method we construct a sequence of completely positive contractions factoring through matrix algebras over A which act on $s_{\xi} s_{\eta}^*$…

The low-rank matrix factorization as a L1 norm minimization problem has recently attracted much attention due to its intrinsic robustness to the presence of outliers and missing data. In this paper, we propose a new method, called the…

This work considers two popular minimization problems: (i) the minimization of a general convex function $f(\mathbf{X})$ with the domain being positive semi-definite matrices; (ii) the minimization of a general convex function…

We give a new proof of the boundedness of bilinear Schur multipliers of second order divided difference functions, as obtained earlier by Potapov, Skripka and Sukochev in their proof of Koplienko's conjecture on the existence of higher…

The problem of sensor network localization (SNL) can be formulated as a semidefinite programming problem with a rank constraint. We propose a new method for solving such SNL problems. We factorize a semidefinite matrix with the rank…

This article is to give an infinite dimensional analogue of a result of Choi and Effros. We say that an (not necessarily unital) operator system $T$ is \emph{dualizable} if one can find an equivalent dual matrix norm on the dual space $T^*$…

A new reorthogonalized block classical Gram--Schmidt algorithm is proposed that factorizes a full column rank matrix $A$ into $A=QR$ where $Q$ is left orthogonal (has orthonormal columns) and $R$ is upper triangular and nonsingular. With…

Let $R=K[x_{1},x_{2},\cdots, x_{m}]$ where $K$ is a field. In this paper, we give some properties of $n$-matrix factorizations of polynomials in $R$. We also derive some results giving some lower bounds on the number of $n$-matrix factors…

Let $s_\nu \circ s_\mu$ denote the plethystic product of the Schur functions $s_\nu$ and $s_\mu$. In this article we define an explicit polynomial representation corresponding to $s_\nu \circ s_\mu$ with basis indexed by certain…