Related papers: A generalized Schur-Horn theorem and optimal frame…

We study a class of spectral design problems in which a prior positive semidefinite information matrix is updated by a sum of rank-one matrices constructed from chosen design vectors subject to a bound on their Euclidean norm. The objective…

Loosely speaking, a semi-frame is a generalized frame for which one of the frame bounds is absent. More precisely, given a total sequence in a Hilbert space, we speak of an upper (resp. lower) semi-frame if only the upper (resp. lower)…

It is well-known that characters classify linear representations of finite groups, that is if characters of two representations of a finite group are the same, these representations are equivalent. It is also well-known that, in general,…

The work of Dykema, Figiel, Weiss, and Wodzicki on the structure of commutators showed that arithmetic means play an important role in the study of operator ideals, and we explored their role in a multipaper project which we survey in this…

Using the recent theory of Krein--von Neumann extensions for positive functionals we present several simple criteria to decide whether a given positive functional on the full operator algebra is normal. We also characterize those…

A spectrahedron is the positivity region of a linear matrix pencil and thus the feasible set of a semidefinite program. We propose and study a hierarchy of sufficient semidefinite conditions to certify the containment of a spectrahedron in…

Schr\"odinger operators with periodic (possibly complex-valued) potentials and discrete periodic operators (possibly with complex-valued entries) are considered, and in both cases the computational spectral problem is investigated: namely,…

To any $V$ in the Grassmannian ${\rm Gr}_k({\mathbb R}^n)$ of $k$-dimensional vector subspaces in ${\mathbb R}^n$ one can associate the diagonal entries of the ($n\times n$) matrix corresponding to the orthogonal projection of ${\mathbb…

While many bounds have been proved for partial trace inequalities over the last decades for a large variety of quantities, recent problems in quantum information theory demand sharper bounds. In this work, we study optimal bounds for…

We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…

We extend the family of classical Schur algebras in type A, which determine the polynomial representation theory of general linear groups over an infinite field, to a larger family, the rational Schur algebras, which determine the rational…

The quaternionic spectral theorem has already been considered in the literature, see e.g. [22], [31], [32], however, except for the finite dimensional case in which the notion of spectrum is associated to an eigenvalue problem, see [21], it…

This paper introduces a reformulation of the classical convergence theorem for spectral sequences of filtered complexes which provides an algorithm to effectively compute the induced filtration on the total (co)homology, as soon as the…

Semilinear maps are a generalization of linear maps between vector spaces where we allow the scalar action to be twisted by a ring homomorphism such as complex conjugation. In particular, this generalization unifies the concepts of linear…

In this paper, we extend Fredholm theory in von Neumann algebras established by Breuer in [5] and [6] to spectral Fredholm theory. We consider 2 by 2 upper triangular operator matrices with coefficients in a von Neumann algebra and give the…

A spectrahedron is a set defined by a linear matrix inequality. A projection of a spectrahedron is often called a semidefinitely representable set. We show that the convex hull of a finite union of such projections is again a projection of…

We prove the existence of a sequence of commutative diagrams generalizing existing results on the cohomology of the Borel-Serre boundary and well-rounded retract to the context of the well-tempered complex. Our main theorem provides a…

Semidefinite programming optimises a linear objective function over a spectrahedron, and is one of the major advances of mathematical optimisation. Spectrahedra are described by linear pencils, which are linear matrix polynomials with…

The classical spectral theorem completely describes self-adjoint operators on finite dimensional inner product vector spaces as linear combinations of orthogonal projections onto pairwise orthogonal subspaces. We prove a similar theorem for…

In this paper we propose a new scaling method to study the Schur complements of $SDD_{1}$ matrices. Its core is related to the non-negative property of the inverse $M$-matrix, while numerically improving the Quotient formula. Based on the…