Related papers: Uniqueness of size-2 positive semidefinite matrix …
The investigation and classification of non-unique factorization phenomena have attracted some interest in recent literature. For finitely generated monoids, S.T. Chapman and P. Garcia-Sanchez, together with several co-authors, derived a…
This work continues the study of the properties of finitely constrained groups of binary tree automorphisms in terms of their Hausdorff dimension. We prove that there are exactly $2^{2d-3}$ finitely constrained groups of binary tree…
This paper presents various worst-case results on the positive semidefinite (psd) rank of a nonnegative matrix, primarily in the context of polytopes. We prove that the psd rank of a generic n-dimensional polytope with v vertices is at…
Using the methods developed for the proof that the 2-universality criterion is unique, we partially characterize criteria for the n-universality of positive-definite integer-matrix quadratic forms. We then obtain the uniqueness of Oh's…
Given a nonnegative matrix factorization, $R$, and a factorization rank, $r$, Exact nonnegative matrix factorization (Exact NMF) decomposes $R$ as the product of two nonnegative matrices, $C$ and $S$ with $r$ columns, such as $R = CS^\top$.…
We prove that a plethysm product of two Schur functions can be factorised uniquely and classify homogeneous and indecomposable plethysm products.
A two--parameter family of asymmetric exclusion processes for particles on a one-dimensional lattice is defined. The two parameters of the model control the driving force and an effect which we call pushing, due to the fact that particles…
We provide an equivalence between the dg category of coherent matrix factorizations and a certain dg category of absolute singularities. As an application, we compute the l-adic cohomology of the dg category of coherent matrix…
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…
In this note, we explore the correspondence between four-dimensional flat space S-matrix and two-dimensional CFT proposed by Pasterski et al. We demonstrate that the factorization singularities of an n-point cubic diagram reproduces the AdS…
We consider several novel aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular if L is regular, and from this deduce an…
This paper establishes that every positive-definite matrix can be written as a positive linear combination of outer products of integer-valued vectors whose entries are bounded by the geometric mean of the condition number and the dimension…
The positive semidefinite (psd) rank of a polytope is the size of the smallest psd cone that admits an affine slice that projects linearly onto the polytope. The psd rank of a d-polytope is at least d+1, and when equality holds we say that…
In this paper we study lower ramification numbers of power series tangent to the identity that are defined over fields of positive characteristics $p$. Let $g$ be such a series, then $g$ has a fixed point at the origin and the corresponding…
Let $\mathcal{S}$ be a small category, and suppose that we are given two (non-full) subcategories $\mathcal{S}^{sm}$ and $\mathcal{S}^{cl}$ that generate all morphisms of $\mathcal{S}$ under composition in the same way as morphisms of…
Positive-definite matrices materialize as state transition matrices of linear time-invariant gradient flows, and the composition of such materializes as the state transition after successive steps where the driving potential is suitably…
Similarity matrix serves as a fundamental tool at the core of numerous downstream machine-learning tasks. However, missing data is inevitable and often results in an inaccurate similarity matrix. To address this issue, Similarity Matrix…
In this article we obtain a result about the uniqueness of factorization in terms of conjugates of the matrix $U=(\xymatrix{1 & 1 0 & 1})$, of some matrices representing the conjugacy classes of those elements of $SL(2,Z)$ arising as the…
When solving large scale semidefinite programs that admit a low-rank solution, an efficient heuristic is the Burer-Monteiro factorization: instead of optimizing over the full matrix, one optimizes over its low-rank factors. This reduces the…
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with applications in collaborative filtering, computer vision and…