Totally Splittable Polytopes
نویسندگان
چکیده
منابع مشابه
ar X iv : 0 70 6 . 25 01 v 3 [ m at h . A G ] 1 4 O ct 2 00 8 MATCHING POLYTOPES , TORIC GEOMETRY , AND THE TOTALLY NON - NEGATIVE GRASSMANNIAN
In this paper we use toric geometry to investigate the topology of the totally non-negative part of the Grassmannian, denoted (Grk,n)≥0. This is a cell complex whose cells ∆G can be parameterized in terms of the combinatorics of plane-bipartite graphs G. To each cell ∆G we associate a certain polytope P (G). The polytopes P (G) are analogous to the well-known Birkhoff polytopes, and we describe...
متن کاملMatching polytopes, toric geometry, and the totally non-negative Grassmannian
In this paper we use toric geometry to investigate the topology of the totally non-negative part of the Grassmannian, denoted (Grk,n)≥0. This is a cell complex whose cells G can be parameterized in terms of the combinatorics of plane-bipartite graphs G. To each cell G we associate a certain polytope P(G). The polytopes P(G) are analogous to the well-known Birkhoff polytopes, and we describe the...
متن کاملar X iv : 0 70 6 . 25 01 v 2 [ m at h . A G ] 2 6 A pr 2 00 8 MATCHING POLYTOPES , TORIC GEOMETRY , AND THE TOTALLY NON - NEGATIVE GRASSMANNIAN
In this paper we use toric geometry to investigate the topology of the totally non-negative part of the Grassmannian, denoted (Grkn)≥0. This is a cell complex whose cells ∆G can be parameterized in terms of the combinatorics of plane-bipartite graphs G. To each cell ∆G we associate a certain polytope P (G). The polytopes P (G) are analogous to the well-known Birkhoff polytopes, and we describe ...
متن کاملFibonacci Polytopes and Their Applications
A Fibonacci d-polytope of order k is defined as the convex hull of {0, 1}-vectors with d entries and no consecutive k ones, where k ≤ d. We show that these vertices can be partitioned into k subsets such that the convex hull of the subsets give the equivalent of Fibonacci (d− i)polytopes, for i = 1, . . . , k, which yields a “Fibonacci like” recursive formula to enumerate the vertices. Surprisi...
متن کاملIsolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces
We deterministically construct quasi-polynomial weights in quasi-polynomial time, such that in a given polytope with totally unimodular constraints, one vertex is isolated, i.e., there is a unique minimum weight vertex. More precisely, the property that we need is that every face of the polytope lies in an affine space defined by a totally unimodular matrix. This derandomizes the famous Isolati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 44 شماره
صفحات -
تاریخ انتشار 2010