Matching polytopes, toric geometry, and the non-negative part of the Grassmannian

Mathematics – Algebraic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

26 pages have been reduced to 19 pages, due to: 1. change of coordinates from face to edge variables 2. K. Talaska's theorem i

Scientific paper

In this paper we use toric geometry to investigate the topology of the totally non-negative part of the Grassmannian (Gr_{kn})_{\geq 0}. This is a cell complex whose cells Delta_G can be parameterized in terms of the combinatorics of plane-bipartite graphs G. To each cell Delta_G we associate a certain polytope P(G). The polytopes P(G) are analogous to the well-known Birkhoff polytopes, and we describe their face lattices in terms of matchings and unions of matchings of G. We also demonstrate a close connection between the polytopes P(G) and matroid polytopes. We then use the data of P(G) to define an associated toric variety X_G. We use our technology to prove that the cell decomposition of (Gr_{kn})_{\geq 0} is a CW complex, and furthermore, that the Euler characteristic of the closure of each cell of (Gr_{kn})_{\geq 0} is 1.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Matching polytopes, toric geometry, and the non-negative part of the Grassmannian does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Matching polytopes, toric geometry, and the non-negative part of the Grassmannian, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Matching polytopes, toric geometry, and the non-negative part of the Grassmannian will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-332477

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.