Related papers: Badly approximable matrix functions and canonical …
We consider the problem of approximating an affinely structured matrix, for example a Hankel matrix, by a low-rank matrix with the same structure. This problem occurs in system identification, signal processing and computer algebra, among…
Nonnegative matrix factorization (NMF) is widely used for clustering with strong interpretability. Among general NMF problems, symmetric NMF is a special one that plays an important role in graph clustering where each element measures the…
Factor Analysis (FA) is a technique of fundamental importance that is widely used in classical and modern multivariate statistics, psychometrics and econometrics. In this paper, we revisit the classical rank-constrained FA problem, which…
The work considers an equivalence relation in the set of all $n\times m$ matrices with entries in the set $[p]=\{ 0,1,\ldots , p-1 \}$. In each element of the factor-set generated by this relation, we define the concept of canonical matrix,…
In this paper, we obtain a new characterization for univalent harmonic mappings and obtain a structural formula for the associated function which defines the analytic $\Phi$-like functions in the unit disk. The new criterion stated in this…
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…
Jury and Martin establish an analogue of the classical inner-outer factorization of Hardy space functions. They show that every function $f$ in a Hilbert function space with a normalized complete Pick reproducing kernel has a factorization…
In binary polynomial optimization, the goal is to find a binary point maximizing a given polynomial function. In this paper, we propose a novel way of formulating this general optimization problem, which we call factorized binary polynomial…
Let us assume that $f$ is a continuous function defined on the unit ball of $\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m \in…
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…
Low rank matrix factorization is a fundamental building block in machine learning, used for instance to summarize gene expression profile data or word-document counts. To be robust to outliers and differences in scale across features, a…
We introduce efficient $(1+\varepsilon)$-approximation algorithms for the binary matrix factorization (BMF) problem, where the inputs are a matrix $\mathbf{A}\in\{0,1\}^{n\times d}$, a rank parameter $k>0$, as well as an accuracy parameter…
Let G be a block matrix function with one diagonal block A being positive definite and the off diagonal blocks complex conjugates of each other. Conditions are obtained for G to be factorable (in particular, with zero partial indices) in…
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…
The application of binary matrices are numerous. Representing a matrix as a mixture of a small collection of latent vectors via low-rank decomposition is often seen as an advantageous method to interpret and analyze data. In this work, we…
We analyze effective approximation of unitary matrices. In our formulation, a unitary matrix is represented as a product of rotations in two-dimensional subspaces, so-called Givens rotations. Instead of the quadratic dimension dependence…
In this paper, we consider an arbitrary matrix-valued, rational spectral density $\Phi(z)$. We show with a constructive proof that $\Phi(z)$ admits a factorization of the form $\Phi(z)=W^\top (z^{-1})W(z)$, where $W(z)$ is stochastically…
Working over a ground field of characteristic zero, this paper studies the quotient morphism $\pi :X\to Y$ for an affine $\mathbb{G}_a$-variety $X$ with affine quotient $Y$. It is shown that the degree modules associated to the…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
If $\phi$ is a submeasure satisfying an appropriate lower estimate we give a quantitative result on the total mass of a measure $\mu$ satisfying $0\le\mu\le\phi.$ We give a dual result for supermeasures and then use these results to…