Related papers: Matrix scaling, explicit Sinkhorn limits, and arit…
Given a boolean n by n matrix A we consider arithmetic circuits for computing the transformation x->Ax over different semirings. Namely, we study three circuit models: monotone OR-circuits, monotone SUM-circuits (addition of non-negative…
For the eigenvalues of principal submatrices of stochastically evolving Wigner matrices, we construct and study the edge scaling limit: a random decreasing sequence of continuous functions of two variables, which at every point has the…
Let $\Omega_n$ denote the class of $n \times n$ doubly stochastic matrices (each such matrix is entrywise nonnegative and every row and column sum is 1). We study the diagonals of matrices in $\Omega_n$. The main question is: which $A \in…
We obtain a tight, up to a logarithmic factor, upper bound on the number of solutions to the equation $$ \sum_{j=1}^n a_j \frac{s_j}{r_j} =a_0, \qquad $$ with variables $r_1,...,r_n$ in an arbitrary box at the origin and variables $s_1,...,…
We present a necessary and sufficient condition for a 3 by 3 matrix to be unitarily equivalent to a symmetric matrix with complex entries, and an algorithm whereby an arbitrary 3 by 3 matrix can be tested. This test generalizes to a…
We use the exact scattering description of the scaling Ashkin-Teller model in two dimensions to compute the two-particle form factors of the relevant operators. These provide an approximation for the correlation functions whose accuracy is…
We provide a randomized linear time approximation scheme for a generic problem about clustering of binary vectors subject to additional constrains. The new constrained clustering problem encompasses a number of problems and by solving it,…
We compute the second and third levels of the Lasserre hierarchy for the spherical finite distance problem. A connection is used between invariants in representations of the orthogonal group and representations of the general linear group,…
We define a new numerical range of an n\timesn complex matrix in terms of correlation matrices and develop some of its properties. We also define a related numerical range that arises from Alain Connes' famous embedding problem.
This paper is concerned with the problem of approximating the determinant of A for a large sparse symmetric positive definite matrix A. It is shown that an efficient solution of this problem is obtained by using a sparse approximate inverse…
We show several ways to round a real matrix to an integer one such that the rounding errors in all rows and columns as well as the whole matrix are less than one. This is a classical problem with applications in many fields, in particular,…
Let $x$ and $y$ be positive $n$-vectors. We show that there exists a $2n\times 2n$ positive definite real matrix whose symplectic spectrum is $y,$ and the symplectic spectrum of whose diagonal is $x$ if and only if $x$ is weakly…
Nonnegative Matrix Factorization (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particularly useful in many applications, e.g., in text mining, image…
The S-matrix in the static limit of a dispersion relation has a finite order N and is a matrix of meromorfic functions of energy in the complex plane with cuts. In the elastic case it reduces to N functions connected by the crossing…
In many problems in Computational Physics and Chemistry, one finds a special kind of sparse matrices, termed "banded matrices". These matrices, which are defined as having non-zero entries only within a given distance from the main…
A parallel algorithm has perfect strong scaling if its running time on P processors is linear in 1/P, including all communication costs. Distributed-memory parallel algorithms for matrix multiplication with perfect strong scaling have only…
We present two sharp, closed-form empirical Bernstein inequalities for symmetric random matrices with bounded eigenvalues. By sharp, we mean that both inequalities adapt to the unknown variance in a tight manner: the deviation captured by…
We derive analytic formulas for the alternating projection method applied to the cone $\mathbb{S}^n_+$ of positive semidefinite matrices and an affine subspace. More precisely, we find recursive relations on parameters representing a…
A concise analytical formula is developed for the inverse of an invertible 3 x 3 matrix using a telescoping method, and is generalized to larger square matrices. The formula is confirmed using randomly generated matrices in Matlab
We consider several aspects of the scaling limit of percolation on random planar triangulations, both finite and infinite. The equivalents for random maps of Cardy's formula for the limit under scaling of various crossing probabilities are…