Related papers: Factorizations of $k$-Nonnegative Matrices
The main result of the note describes certain optimal-score partitions, which can be interpreted as optimal resource allocations. This result is based on the fact that any nonnegative square matrix whose column sums are the same as the…
Following the works by Lin et al. (Circuits Syst. Signal Process. 20(6): 601-618, 2001) and Liu et al. (Circuits Syst. Signal Process. 30(3): 553-566, 2011), we investigate how to factorize a class of multivariate polynomial matrices. The…
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been applied in several applications, it does not always result in…
We address the fact that composition in an opetopic weak n-category is in general not unique and hence is not a well-defined operation. We define composition with a given k-cell in an n-category by a span of (n-k)-categories. We…
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…
We investigate compressibility of the dimension of positive semidefinite matrices while approximately preserving their pairwise inner products. This can either be regarded as compression of positive semidefinite factorizations of…
We introduce the concept of multiplicatively closed subsets of a commutative ring $R$ which split an $R$-module $M$ and study factorization properties of elements of $M$ with respect to such a set. Also we demonstrate how one can utilize…
The semigroups of unital extensions of separable $C^\ast$-algebras come in two flavours: a strong and a weak version. By the unital $\mathrm{Ext}$-groups, we mean the groups of invertible elements in these semigroups. We use the unital…
We investigate tensor products of matrix factorisations. This is most naturally done by formulating matrix factorisations in terms of bimodules instead of modules. If the underlying ring is C[x_1,...,x_N] we show that bimodule matrix…
A classical tool in the study of real closed fields are the fields $K((G))$ of generalised power series (i.e., formal sums with well-ordered support) with coefficients in a field $K$ of characteristic 0 and exponents in an ordered abelian…
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…
Some new characterizations of nonnegative Hamiltonian operator matrices are given. Several necessary and sufficient conditions for an unbounded nonnegative Hamiltonian operators to be invertible are obtained; so that the main results in the…
Plabic graphs are interesting combinatorial objects used to study the totally nonnegative Grassmannian. Faces of plabic graphs are labeled by $k$-element sets of positive integers, and a collection of such $k$-element sets are the face…
We relate weak distributive laws in SetMat to strictly associative (but not strictly unital) pseudoalgebras of the 2-monad (-)^2 on Cat. The corresponding orthogonal factorization systems are characterized by a certain bilinearity property.
Given a positive integer k, we investigate the class of numerical semigroups verifying the property that every two subsequent non gaps, smaller than the conductor, are spaced by at least k. These semigroups will be called k-sparse and…
We give extensions of results on nonnegative matrix semigroups which deduce finiteness or boundedness of such semigroups from the corresponding local properties, e.g., from finiteness or boundedness of values of certain linear functionals…
We give a short proof of a recent result by Bernik, Mastnak, and Radjavi, stating that an irreducible group of complex matrices with nonnegative diagonal entries is diagonally similar to a group of nonnegative monomial matrices. We also…
Factorizations of monoids are studied. Two necessary and sufficient conditions in terms of so-called descent 1-cocyles for a monoid to be factorized through two submonoids are found. A full classification of those factorizations of a monoid…
A group $G$ is said to be $k$-generated if it has a generating set with $k$ elements. A positive integer $n$ is called a \emph{2-generated number} if every group of order $n$ is 2-generated. In this article, we establish an arithmetic…
We consider unimodular matrices $M$ such that neither $M$ nor $M^{-1}$ contain zero entries. Matrices typically exhibit a trade-off: small $M$ imply large $M^{-1}$. We investigate rare cases where both remain small, classify these matrices…