Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Sign variation, the Grassmannian, and total positivity (1503.05622v3)

Published 19 Mar 2015 in math.CO, hep-th, and math.CA

Abstract: The totally nonnegative Grassmannian is the set of k-dimensional subspaces V of Rn whose nonzero Pluecker coordinates all have the same sign. Gantmakher and Krein (1950) and Schoenberg and Whitney (1951) independently showed that V is totally nonnegative iff every vector in V, when viewed as a sequence of n numbers and ignoring any zeros, changes sign at most k-1 times. We generalize this result from the totally nonnegative Grassmannian to the entire Grassmannian, showing that if V is generic (i.e. has no zero Pluecker coordinates), then the vectors in V change sign at most m times iff certain sequences of Pluecker coordinates of V change sign at most m-k+1 times. We also give an algorithm which, given a non-generic V whose vectors change sign at most m times, perturbs V into a generic subspace whose vectors also change sign at most m times. We deduce that among all V whose vectors change sign at most m times, the generic subspaces are dense. These results generalize to oriented matroids. As an application of our results, we characterize when a generalized amplituhedron construction, in the sense of Arkani-Hamed and Trnka (2013), is well defined. We also give two ways of obtaining the positroid cell of each V in the totally nonnegative Grassmannian from the sign patterns of vectors in V.

Summary

We haven't generated a summary for this paper yet.