Convex Hulls of Grassmannians and Combinatorics of Symmetric Hypermatrices

Abstract

It is known that the complex Grassmannian of k-dimensional subspaces can be identified with the set of projection matrices of rank k. It is also classically known that the convex hull of this set is the set of Hermitian matrices with eigenvalues between 0 and 1 and summing to k. We give a new proof of this fact. We also give an existence theorem for a certain combinatorial class of hypermatrices by a similar argument. This existence theorem can be rewritten into an existence theorem for a uniform weighted hypergraph with given weighted degree sequence.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…