Related papers: Multiple Horn problems for planar networks and inv…
The problem of determining the set of possible eigenvalues of 3 Hermitian matrices that sum up to zero is known as the Horn problem. The answer is a polyhedral cone, which, following Knutson and Tao, can be described as the projection of a…
Horn's problem, i.e., the study of the eigenvalues of the sum $C=A+B$ of two matrices, given the spectrum of $A$ and of $B$, is re-examined, comparing the case of real symmetric, complex Hermitian and self-dual quaternionic $3\times 3$…
In this paper, we give a symplectic proof of the Horn inequalities on eigenvalues of a sum of two Hermitian matrices with given spectra. Our method is a combination of tropical calculus for matrix eigenvalues, combinatorics of planar…
Horn's problem is concerned with characterizing the eigenvalues $(a,b,c)$ of Hermitian matrices $(A,B,C)$ satisfying the constraint $A+B=C$ and forming the edges of a triangle in the space of Hermitian matrices. It has deep connections to…
We give an exposition of the Horn inequalities and their triple role characterizing tensor product invariants, eigenvalues of sums of Hermitian matrices, and intersections of Schubert varieties. We follow Belkale's geometric method, but…
Horn's problem -- to find the support of the spectrum of eigenvalues of the sum $C=A+B$ of two $n$ by $n$ Hermitian matrices whose eigenvalues are known -- has been solved by Knutson and Tao. Here the probability distribution function (PDF)…
Identifying the spectrum of the sum of two given Hermitian matrices with fixed eigenvalues is the famous Horn's problem.In this note, we investigate a variant of Horn's problem, i.e., we identify the probability density function (abbr. pdf)…
We review recent progress on Horn's problem, which asks for a description of the possible eigenspectra of the sum of two matrices with known eigenvalues. After revisiting the classical case, we consider several generalizations in which the…
The Horn inequalities characterise the possible spectra of triples of $n$-by-$n$ Hermitian matrices $A+B=C$. We study integral inequalities that arise as limits of Horn inequalities as $n \to \infty$. These inequalities are parametrised by…
We consider the analogues of the Horn inequalities in finite von Neumann algebras, which concern the possible spectral distributions of sums $a+b$ of self--adjoint elements $a$ and $b$ in a finite von Neumann algebra. It is an open question…
The randomised Horn problem, in both its additive and multiplicative version, has recently drawn increasing interest. Especially, closed analytical results have been found for the rank-1 perturbation of sums of Hermitian matrices and…
Given two nonincreasing $n$-tuples of real numbers $\lambda_n$, $\mu_n$, the Horn problem asks for a description of all nonincreasing $n$-tuples of real numbers $\nu_n$ such that there exist Hermitian matrices $X_n$, $Y_n$ and $Z_n$…
We determine the possible eigenvalues of compact selfadjoint operators A,B,C... with the property that A=B+C+... When all these operators are positive, the eigenvalues were known to be subject to certain inequalities which extend Horn's…
Tree tensor networks such as the tensor train format are a common tool for high dimensional problems. The associated multivariate rank and accordant tuples of singular values are based on different matricizations of the same tensor. While…
We perform a refined complexity-theoretic analysis of three classical problems in the context of Hierarchical Task Network Planning: the verification of a provided plan, whether an executable plan exists, and whether a given state can be…
Horn's problem was the following: given two Hermitian matrices with known spectra, what might be the eigenvalue spectrum of the sum? This linear algebra problem is exactly of the sort to be approached with the methods of modern Hamiltonian…
Multiple orthogonal polynomials are a generalization of orthogonal polynomials in which the orthogonality is distributed among a number of orthogonality weights. They appear in random matrix theory in the form of special determinantal point…
We give necessary and sufficient inequalities for the existence of long exact sequences of m finite abelian p-groups with fixed isomorphy types. This problem is related to some generalized Littlewood-Richardson coefficients that we define…
The network pricing problem (NPP) is a bilevel problem, where the leader optimizes its revenue by deciding on the prices of certain arcs in a graph, while expecting the followers (also known as the commodities) to choose a shortest path…
Given a matrix $A$, a linear feasibility problem (of which linear classification is a special case) aims to find a solution to a primal problem $w: A^Tw > \textbf{0}$ or a certificate for the dual problem which is a probability distribution…