Related papers: Continuous factorization of the identity matrix
We describe the pushforward of a matrix factorisation along a ring morphism in terms of an idempotent defined using relative Atiyah classes, and use this construction to study the convolution of kernels defining integral functors between…
We study processes with unstable particles in intermediate time-like states. It is shown that the amplitudes squared of such processes factor exactly in the framework of the model of unstable particles with continuous masses. Decay widths…
Properties of the two dimensional Ising model with fixed magnetization are deduced from known exact results on the two dimensional Ising model. The existence of a continuous phase transition is shown for arbitrary values of the fixed…
We identify and analyse obstructions to factorisation of integer matrices into products $N^T N$ or $N^2$ of matrices with rational or integer entries. The obstructions arise as quadratic forms with integer coefficients and raise the…
We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…
In a recent paper, an algorithm has been presented for determining implications between a particular kind of category theoretic property represented by matrices -- the so called `matrix properties'. In this paper we extend this algorithm to…
This article examines matrices whose entries are determined by recursive relations of the form $A_{i, j} = x A_{i, j-1} + y A_{i-1, j-1} + z A_{i-1, j}$, where $x, y, z$ are constants, and the initial conditions are defined along the first…
Matrix factorization techniques, especially Nonnegative Matrix Factorization (NMF), have been widely used for dimensionality reduction and interpretable data representation. However, existing NMF-based methods are inherently single-scale…
Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative $n \times m$ matrix $M$ into a product of a nonnegative $n \times d$ matrix $W$ and a nonnegative $d \times m$ matrix $H$. A longstanding open…
The aim of this paper is to present new upper bounds for the distance between a properly normalized permanent of a rectangular complex matrix and the product of the arithmetic means of the entries of its columns. It turns out that the…
We show that a normal matrix $A$ with coefficient in $\mathbb C[[X]]$, $X=(X_1, \ldots, X_n)$, can be diagonalized, provided the discriminant $\Delta_A $ of its characteristic polynomial is a monomial times a unit. The proof is an…
The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrices and the corresponding identity matrices are of rank k) in…
In this note, firstly we give an easy proof of the factorization of symmetric matrices (see [Mos] math-ph/0203023), then we use it to prove the well-known fact that the automorphism group of a non-degenerate symmetric bilinear form acts…
We construct an iterative method for factorising small strict n-categories into a unique (up to isomorphism) collection of small 1- categories. Following this we develop the theory to include a large class of $\infty$-categories. We use…
Non-negative matrix factorization (NMF) is a prob- lem with many applications, ranging from facial recognition to document clustering. However, due to the variety of algorithms that solve NMF, the randomness involved in these algorithms,…
Let A be an n by n matrix with entries in an arbitrary field, and c_1,...,c_n be scalars. We prove that if A is not a scalar multiple of the identity matrix, then the condition c_1+...+c_n=tr(A) is necessary and sufficient for A to be…
The factorization proposal claims that the co-dimension one "pinning defect", on which a local relevant operator is integrated, factorizes the space into two halves in general conformal field theories in the infrared limit. In this letter,…
Boolean matrix factorization is a natural and a popular technique for summarizing binary matrices. In this paper, we study a problem of Boolean matrix factorization where we additionally require that the factor matrices have consecutive…
The book is devoted to investigation of arithmetic of the matrix rings over certain classes of commutative finitely generated principal ideals domains. We mainly concentrate on constructing of the matrix factorization theory. We reveal a…
An (additive) commutative monoid is called atomic if every given non-invertible element can be written as a sum of atoms (i.e., irreducible elements), in which case, such a sum is called a factorization of the given element. The number of…