نتایج جستجو برای: n polytope
تعداد نتایج: 979188 فیلتر نتایج به سال:
We begin with a lattice N isomorphic to Z. The dual lattice M of N is given by Hom(N,Z); it is also isomorphic to Z. (The alphabet may appear to be going backwards; but this notation is standard in the literature.) We write the pairing of v ∈ N and w ∈M as 〈v, w〉. A cone in N is a subset of the real vector space NR = N ⊗R generated by nonnegative R-linear combinations of a set of vectors {v1, ....
TheMonotone Upper Bound Problem (Klee, 1965) asks if the numberM(d, n) of vertices in a monotone path along edges of a d-dimensional polytope with n facets can be as large as conceivably possible: Is M(d, n) = Mubt(d, n), the maximal number of vertices that a d-polytope with n facets can have according to the Upper Bound Theorem? We show that in dimension d = 4, the answer is “yes”, despite the...
Let IH be the n-dimensional hyperbolic space and let P be a simple polytope in IH. P is called an ideal polytope if all vertices of P belong to the boundary of IH. P is called a Coxeter polytope if all dihedral angles of P are submultiples of π. There is no complete classification of hyperbolic Coxeter polytopes. In [6] Vinberg proved that there are no compact hyperbolic Coxeter polytopes in IH...
Richard Stanley introduced the order polytope O(P ) and the chain polytope C(P ) arising from a finite partially ordered set P , and showed that the Ehrhart polynomial of O(P ) is equal to that of C(P ). In addition, the unimodular equivalence problem of O(P ) and C(P ) was studied by the first author and Nan Li. In the present paper, three integral convex polytopes Γ(O(P ),−O(Q)), Γ(O(P ),−C(Q...
We express the matroid polytope PM of a matroid M as a signed Minkowski sum of simplices, and obtain a formula for the volume of PM . This gives a combinatorial expression for the degree of an arbitrary torus orbit closure in the Grassmannian Grk,n. We then derive analogous results for the independent set polytope and the associated flag matroid polytope of M . Our proofs are based on a natural...
Let us first recall our setting. In the toric case, there is a correspondence between n-dimensional nonsingular Fano varieties and ndimensional Fano polytopes, where the Fano varieties are biregular isomorphic if and only if the corresponding Fano polytopes are unimodularly equivalent. Here, given a lattice N of rank n, a Fano polytope Q ⊆ NR := N ⊗Z R is given as a lattice polytope containing ...
We study Lovász and Schrijver’s hieararchy of relaxations based on positive semidefiniteness constraints derived from the fractional stable set polytope. We show that there are graphsG for which a single application of the underlying operator, N+, to the fractional stable set polytope gives a nonpolyhedral convex relaxation of the stable set polytope. We also show that none of the current best ...
We study the skeleton of several polytopes related to the n-cube, the halved n-cube, and the folded n-cube. In particular, the Gale polytope of the n-cube, its dual and the duals of the halved n-cube and the complete bipartite sub-graphs polytope.
We investigate the diameter of the polytope arising in the n-city symmetric traveling salesman problem (TSP) and perfect matching polytopes. Grötschel and Padberg [The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley-Intersci. Ser. Discrete Math., E. Lawler et al., eds., John Wiley, Chichester, 1985, pp. 251–305] conjectured that the diameter of the symmetric TSP p...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید