Related papers: Factorization and dilation problems for completely…
We describe conditions that characterize amenability for groups in terms of positive definite functions valued in a von Neumann algebra.
For a given set of input-output pairs of quantum states or observables, we ask the question whether there exists a physically implementable transformation that maps each of the inputs to the corresponding output. The physical maps on…
We analyze semigroups of decomposable maps on C*-algebras in context of the algebraic structure of associated infinitesimal generators. Case of von Neumann algebras, including $B(\mathcal{H})$ for $\mathcal{H}$ a Hilbert space, is also…
In the Nonnegative Matrix Factorization (NMF) problem we are given an $n \times m$ nonnegative matrix $M$ and an integer $r > 0$. Our goal is to express $M$ as $A W$ where $A$ and $W$ are nonnegative matrices of size $n \times r$ and $r…
Completely positive trace preserving maps are widely used in quantum information theory. These are mostly studied using the master equation perspective. A central part in this theory is to study whether a given system of dynamical maps…
We characterize weakly harmonic maps with respect to non-local Dirichlet forms by Markov processes and martingales. In particular, we can obtain discontinuous martingales on Riemannian manifolds from the image of symmetric stable processes…
We study dynamical semigroups of positive, but not completely positive maps on finite-dimensional bipartite systems and analyze properties of their generators in relation to non-decomposability and bound-entanglement. An example of…
A reduction formula for compressions of von Neumann algebras arising as free products is proved. This shows that the fundamental group is all of the positive reals for some such algebras. Additionally, by taking a sort of free product with…
We provide a complete characterization of theories of tracial von Neumann algebras that admit quantifier elimination. We also show that the theory of a separable tracial von Neumann algebra $\mathcal{N}$ is never model complete if its…
We use the language of von Neumann subfactors to investigate non-invertible symmetries in two dimensions. A fusion categorical symmetry $\mathcal{C}$, its module category $\mathcal{M}$, and a gauging labeled by an algebra object…
We define a canonical relative commutant planar algebra from a strongly Markov inclusion of finite von Neumann algebras. In the case of a connected unital inclusion of finite dimensional C*-algebras with the Markov trace, we show this…
Copositive optimization is a special case of convex conic programming, and it consists of optimizing a linear function over the cone of all completely positive matrices under linear constraints. Copositive optimization provides powerful…
Dirichlet-to-Neumann maps enable the coupling of multiphysics simulations across computational subdomains by ensuring continuity of state variables and fluxes at artificial interfaces. We present a novel method for learning…
Non-negative Matrix Factorization (NMF) asks to decompose a (entry-wise) non-negative matrix into the product of two smaller-sized nonnegative matrices, which has been shown intractable in general. In order to overcome this issue, the…
Nonnegative matrix factorization (NMF), which is the approximation of a data matrix as the product of two nonnegative matrices, is a key issue in machine learning and data analysis. One approach to NMF is to formulate the problem as a…
For a spectrally negative positive self-similar Markov process with an a.s. finite overall supremum we provide, in tractable detail, a kind of conditional Wiener-Hopf factorization at the maximum of the absorption time at zero, the…
We prove a factorization theorem for reproducing kernel Hilbert spaces whose kernel has a normalized complete Nevanlinna-Pick factor. This result relates the functions in the original space to pointwise multipliers determined by the…
Let $A$ be a matrix with nonnegative real entries. A nonnegative factorization of size $k$ is a representation of $A$ as a sum of $k$ nonnegative rank-one matrices. The space of all such factorizations is a bounded semialgebraic set, and we…
Non-negative matrix factorization (NMF) has proved effective in many clustering and classification tasks. The classic ways to measure the errors between the original and the reconstructed matrix are $l_2$ distance or Kullback-Leibler (KL)…
We analyze the factorization process for lattice maps, searching for integrable cases. The maps were assumed to be at most quadratic in the dependent variables, and we required minimal factorization (one linear factor) after 2 steps of…