Related papers: Partial classification of spectrum maximizing prod…
We study a matrix product state (MPS) algorithm to approximate excited states of translationally invariant quantum spin systems with periodic boundary conditions. By means of a momentum eigenstate ansatz generalizing the one of \"Ostlund…
Two-dimensional linear spaces of symmetric matrices are classified by Segre symbols. After reviewing known facts from linear algebra and projective geometry, we address new questions motivated by algebraic statistics and optimization. We…
Very recently we have shown that the spherical transform is a convenient tool for studying the relation between the joint density of the singular values and that of the eigenvalues for bi-unitarily invariant random matrices. In the present…
We study skew-products of the form $(x,u) \mapsto (fx, u + \varphi(x))$ where $f$ is a non-uniformly expanding map on a manifold $X$ and $\varphi: X \to \mathbb{S}^1$ is piecewise $\mathcal{C}^1$. If the systems satisfies mild assumptions…
We study the gaps between consecutive singular values of random rectangular matrices. Specifically, if $M$ is an $n \times p$ random matrix with independent and identically distributed entries and $\Sigma$ is a $n \times n$ deterministic…
We find the exact solution for the stationary state measure of the partially asymmetric exclusion process on a ring with multiple species of particles. The solution is in the form of a matrix product representation where the matrices for a…
The generalization of matrix product states (MPS) to continuous systems, as proposed in the breakthrough paper [F. Verstraete, J.I. Cirac, Phys. Rev. Lett. 104, 190405(2010)], provides a powerful variational ansatz for the ground state of…
Given a set $S$ of $n$ points in $\mathbb{R}^d$, the Closest Pair problem is to find a pair of distinct points in $S$ at minimum distance. When $d$ is constant, there are efficient algorithms that solve this problem, and fast approximate…
We determine the structure of linear maps on complex (real) square matrices sending unitary (orthogonal) matrices to multiples of unitary (orthogonal) matrices. The result is used to determine the linear preservers of matrix pairs…
We consider two seemingly unconnected problems: first, under what circumstances are arithmetic groups like SL(2,O) generated by elementary matrices; second, when do certain classes of circle/sphere packings fill up space? We show that these…
We design optimal $2 \times N$ ($2 <N$) matrices, with unit columns, so that the maximum condition number of all the submatrices comprising 3 columns is minimized. The problem has two applications. When estimating a 2-dimensional signal by…
There are two main examples where a version of the Minimal Model Program can, at least conjecturally, be performed successfully: the first is the classical MMP associated to the canonical divisor, and the other is Mori Dream Spaces. In this…
We quantify the representational power of matrix product states (MPS) for entangled qubit systems by giving polynomial expressions in a pure quantum state's amplitudes which hold if and only if the state is a translation invariant matrix…
Computation of the large sparse matrix exponential has been an important topic in many fields, such as network and finite-element analysis. The existing scaling and squaring algorithm (SSA) is not suitable for the computation of the large…
Properties of Hermitian forms are used to investigate several natural questions from CR Geometry. To each Hermitian symmetric polynomial we assign a Hermitian form. We study how the signature pairs of two Hermitian forms behave under the…
We construct matrix product steady state for a class of interacting particle systems where particles do not obey hardcore exclusion, meaning each site can occupy any number of particles subjected to the global conservation of total number…
We advance the Cohn-Umans framework for developing fast matrix multiplication algorithms. We introduce, analyze, and search for a new subclass of strong uniquely solvable puzzles (SUSP), which we call simplifiable SUSPs. We show that these…
An efficient algorithm for SU(2) symmetric matrix product states (MPS) with periodic boundary conditions (PBC) is proposed and implemented. It is applied to a study of the spectrum and correlation properties of the spin-1…
The multiple-input multiple-output (MIMO) detection problem, a fundamental problem in modern digital communications, is to detect a vector of transmitted symbols from the noisy outputs of a fading MIMO channel. The maximum likelihood…
Matrix completion is a basic machine learning problem that has wide applications, especially in collaborative filtering and recommender systems. Simple non-convex optimization algorithms are popular and effective in practice. Despite recent…