Symmetrization of Principal Minors and Cycle-Sums

Abstract

We solve the Symmetrized Principal Minor Assignment Problem, that is we show how to determine if for a given vector v∈ Cn there is an n× n matrix that has all i× i principal minors equal to vi. We use a special isomorphism (a non-linear change of coordinates to cycle-sums) that simplifies computation and reveals hidden structure. We use the symmetries that preserve symmetrized principal minors and cycle-sums to treat 3 cases: symmetric, skew-symmetric and general square matrices. We describe the matrices that have such symmetrized principal minors as well as the ideal of relations among symmetrized principal minors / cycle-sums. We also connect the resulting algebraic varieties of symmetrized principal minors to tangential and secant varieties, and Eulerian polynomials.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…