The largest small n-dimensional polytope with n+3 vertices
نویسندگان
چکیده
منابع مشابه
On the Vertices of the d-Dimensional Birkhoff Polytope
Let us denote by Ωn the Birkhoff polytope of n× n doubly stochastic matrices. As the Birkhoff–von Neumann theorem famously states, the vertex set of Ωn coincides with the set of all n× n permutation matrices. Here we consider a higherdimensional analog of this basic fact. Let Ω n be the polytope which consists of all tristochastic arrays of order n. These are n×n×n arrays with nonnegative entri...
متن کاملGraphic vertices of the metric polytope
The metric polytope ,//~. is defined by the triangle inequalities: xij-Xik-Xjk <~ 0 and xii + Xik + Xjk ~< 2 for all triples i,j, k of(1 ..... n}. The integral vertices of ~¢¢~. are the incidence vectors of the cuts of the complete graph Kn. Therefore, ~¢~. is a relaxation of the cut polytope of K~. We study here the fractional vertices of ~¢¢~. Many of them are constructed from graphs; this is...
متن کاملThe Packing Density of the n-Dimensional Cross-Polytope
The packing density of the regular cross-polytope in Euclidean n-space is unknown except in dimensions 2 and 4 where it is 1. The only non-trivial upper bound is due to Gravel, Elser, and Kallus [9] who proved that for n = 3 the packing density of the regular octahedron is at most 1 − 1.4 . . .× 10. In this paper, we prove upper bounds for the packing density of the n-dimensional regular cross-...
متن کاملAN EXTREMUM PROPERTY CHARACTERIZING THE n-DIMENSIONAL REGULAR CROSS-POLYTOPE
In the spirit of the Genetics of the Regular Figures, by L. Fejes Tóth [FT, Part 2], we prove the following theorem: If 2n points are selected in the n-dimensional Euclidean ball Bn so that the smallest distance between any two of them is as large as possible, then the points are the vertices of an inscribed regular cross-polytope. This generalizes a result of R.A. Rankin [R] for 2n points on t...
متن کاملOrdering trees with n vertices and matching number q by their largest Laplacian eigenvalues
Denote by Tn,q the set of trees with n vertices and matching number q. Guo [On the Laplacian spectral radius of a tree, Linear Algebra Appl. 368 (2003) 379–385] gave the tree in Tn,q with the greatest value of the largest Laplacian eigenvalue. In this paper, we give another proof of this result. Using our method, we can go further beyond Guo by giving the tree in Tn,q with the second largest va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2003
ISSN: 0097-3165
DOI: 10.1016/s0097-3165(03)00054-2