Related papers: Matrix scaling, explicit Sinkhorn limits, and arit…
In recent papers we have studied refined enumerations of alternating sign matrices with respect to a fixed set of top and bottom rows. The present paper is a first step towards extending these considerations to alternating sign matrices…
We count the number of alignments of $N \ge 1$ sequences when match-up types are from a specified set $S\subseteq \mathbb{N}^N$. Equivalently, we count the number of nonnegative integer matrices whose rows sum to a given fixed vector and…
A new set of infinitesimal transformations generalizing scale invariance for strongly anisotropic critical systems is considered. It is shown that such a generalization is possible if the anisotropy exponent \theta =2/N, with N=1,2,3 ...…
Low-rank matrix approximations are often used to help scale standard machine learning algorithms to large-scale problems. Recently, matrix coherence has been used to characterize the ability to extract global information from a subset of…
We show that in $\text{O}(D)$ invariant matrix theories containing a large number $D$ of complex or Hermitian matrices, one can define a $D\rightarrow\infty$ limit for which the sum over planar diagrams truncates to a tractable, yet…
We explore the asymptotic convergence and nonasymptotic maximal inequalities of supermartingales and backward submartingales in the space of positive semidefinite matrices. These are natural matrix analogs of scalar nonnegative…
Iterative methods based on matrix splittings are useful in solving large sparse linear systems. In this direction, proper splittings and its several extensions are used to deal with singular and rectangular linear systems. In this article,…
Ensembles of random stochastic and bistochastic matrices are investigated. While all columns of a random stochastic matrix can be chosen independently, the rows and columns of a bistochastic matrix have to be correlated. We evaluate the…
We consider the problem of matrix completion on an $n \times m$ matrix. We introduce the problem of Interpretable Matrix Completion that aims to provide meaningful insights for the low-rank matrix using side information. We show that the…
We study the double- and triple-scaling limits of a complex multi-matrix model, with $\mathrm{U}(N)^2\times \mathrm{O}(D)$ symmetry. The double-scaling limit amounts to taking simultaneously the large-$N$ (matrix size) and large-$D$ (number…
We solve the loop equations to all orders in $1/N^2$, for the Chain of Matrices matrix model (with possibly an external field coupled to the last matrix of the chain). We show that the topological expansion of the free energy, is, like for…
In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical…
If $A$ is a $2n \times 2n$ real positive definite matrix, then there exists a symplectic matrix $M$ such that $M^TAM = \left [ \begin{array}{cc} D & O \\ O & D \end{array} \right ]$ where $D= \diag (d_1 (A), \ldots, d_n(A))$ is a diagonal…
An exponential representation of the S-matrix provides a natural framework for understanding the semi-classical limit of scattering amplitudes. While sharing some similarities with the eikonal formalism it differs from it in details.…
Using duality in optimization theory we formulate a dual approach to the S-matrix bootstrap that provides rigorous bounds to 2D QFT observables as a consequence of unitarity, crossing symmetry and analyticity of the scattering matrix. We…
Symmetric Nonnegative Matrix Factorization (SNMF) models arise naturally as simple reformulations of many standard clustering algorithms including the popular spectral clustering method. Recent work has demonstrated that an elementary…
We present here necessary and sufficient conditions for the invertibility of circulant and symmetric matrices that depend on three parameters and moreover, we explicitly compute the inverse. The techniques we use are related with the…
An alternating sign matrix, or ASM, is a $(0, \pm 1)$-matrix where the nonzero entries in each row and column alternate in sign. We generalize this notion to hypermatrices: an $n\times n\times n$ hypermatrix $A=[a_{ijk}]$ is an {\em…
Given a symmetric nonnegative matrix $A$, symmetric nonnegative matrix factorization (symNMF) is the problem of finding a nonnegative matrix $H$, usually with much fewer columns than $A$, such that $A \approx HH^T$. SymNMF can be used for…
The concept of conformal field theory provides a general classification of statistical systems on two-dimensional geometries at the point of a continuous phase transition. Considering the finite-size scaling of certain special observables,…