Related papers: Factorization of stochastic maps using the Stinesp…
Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…
We discuss existence of factorizations with linear factors for (left) polynomials over certain associative real involutive algebras, most notably over Clifford algebras. Because of their relevance to kinematics and mechanism science, we put…
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…
In this paper, we consider the problem of finding an almost surely common fixed point of a family of paracontraction maps indexed on a probability space, which we refer to as the stochastic feasibility problem. We show that a random…
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…
We prove some noncommutative analogues of a theorem by Plotkin and Rudin about isometries between subspaces of Lp-spaces. Let 0<p<\infty, p not an even integer. The main result of this paper states that in the category of unital subspaces…
In this article we prove that quasi-multiplicative (with respect to the usual length function) mappings on the permutation group $\SSn$ (or, more generally, on arbitrary amenable Coxeter groups), determined by self-adjoint contractions…
The spectral factorization mapping $F\to F^+$ puts a positive definite integrable matrix function $F$ having an integrable logarithm of the determinant in correspondence with an outer analytic matrix function $F^+$ such that $F =…
The factor graph of an instance of a symmetric constraint satisfaction problem on n Boolean variables and m constraints (CSPs such as k-SAT, k-AND, k-LIN) is a bipartite graph describing which variables appear in which constraints. The…
Stochastic mass transport models are usually described by specifying hopping rates of particles between sites of a given lattice, and the goal is to predict the existence and properties of the steady state. Here we ask the reverse question:…
A ring has bounded factorizations if every cancellative nonunit $a \in R$ can be written as a product of atoms and there is a bound $\lambda(a)$ on the lengths of such factorizations. The bounded factorization property is one of the most…
Using the diagrammatic approach to integrals over Gaussian random matrices, we find a representation for polynomial Lie group integrals as infinite sums over certain maps on surfaces. The maps involved satisfy a specific condition: they…
The generic linear evolution of the density matrix of a system with a finite-dimensional state space is by stochastic maps which take a density matrix linearly into the set of density matrices. These dynamical stochastic maps form a linear…
In this paper, we introduce the concept of completely positive matrix of linear maps on Hilbert $A$-modules over locally $C^{*}$-algebras and prove an analogue of Stinespring theorem for it. We show that any two minimal Stinespring…
To a planar algebra P in the sense of Jones we associate a natural non- commutative ring, which can be viewed as the ring of non-commutative polynomials in several indeterminates, invariant under a symmetry encoded by P. We show that this…
When a matrix has a banded inverse there is a remarkable formula that quickly computes that inverse, using only local information in the original matrix. This local inverse formula holds more generally, for matrices with sparsity patterns…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…
The ability to represent complex high dimensional probability distributions in a compact form is one of the key insights in the field of graphical models. Factored representations are ubiquitous in machine learning and lead to major…
We extend path analysis by showing that, for a singly-connected path diagram, the partial covariance of two random variables factorizes over the nodes and edges in the path between the variables. This result allows us to determine the…
We introduce a Bayesian perspective for the structured matrix factorization problem. The proposed framework provides a probabilistic interpretation for existing geometric methods based on determinant minimization. We model input data…