skip to content
The d-step conjecture for polyhedra of dimension d<6. Preview this item
ClosePreview this item
Checking...

The d-step conjecture for polyhedra of dimension d<6.

Author: Victor Klee; David W Walkup; BOEING SCIENTIFIC RESEARCH LABS SEATTLE WASH MATHEMATICS RESEARCH LAB.
Publisher: Ft. Belvoir Defense Technical Information Center DEC 1965.
Edition/Format:   Book : English
Database:WorldCat
Summary:
Two functions A and B, of interest in combinatorial geometry and the theory of linear programming, are defined and studied. A(d, n) is the maximum diameter of convex polyhedra of dimension d with n faces of dimension d-1; similarly, B(d, n) is the maximum diameter of bounded polyhedra of dimension d with n faces of dimension d-1. The diameter of a polyhedron P is the smallest integer k such that any two vertices of  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Victor Klee; David W Walkup; BOEING SCIENTIFIC RESEARCH LABS SEATTLE WASH MATHEMATICS RESEARCH LAB.
OCLC Number: 227397643
Notes: Also available from the authors.
Description: 47 p.

Abstract:

Two functions A and B, of interest in combinatorial geometry and the theory of linear programming, are defined and studied. A(d, n) is the maximum diameter of convex polyhedra of dimension d with n faces of dimension d-1; similarly, B(d, n) is the maximum diameter of bounded polyhedra of dimension d with n faces of dimension d-1. The diameter of a polyhedron P is the smallest integer k such that any two vertices of P can be joined by a path of k or fewer edges of P. It is shown that the bounded d-step conjecture, i.e. B(d,2d) = d, is true for d <or 5. It is also shown that the general d-step conjecture, i.e. A(d,2d) <or = d, of significance in linear programming, is false for d equal to or greater than 4. A number of other specific values and bounds for A and B are presented.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227397643>
library:oclcnum"227397643"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227397643>
rdf:typeschema:Book
rdfs:seeAlso
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:contributor
rdf:typeschema:Organization
schema:name"BOEING SCIENTIFIC RESEARCH LABS SEATTLE WASH MATHEMATICS RESEARCH LAB."
schema:datePublished"1965"
schema:datePublished"DEC 1965"
schema:description"Two functions A and B, of interest in combinatorial geometry and the theory of linear programming, are defined and studied. A(d, n) is the maximum diameter of convex polyhedra of dimension d with n faces of dimension d-1; similarly, B(d, n) is the maximum diameter of bounded polyhedra of dimension d with n faces of dimension d-1. The diameter of a polyhedron P is the smallest integer k such that any two vertices of P can be joined by a path of k or fewer edges of P. It is shown that the bounded d-step conjecture, i.e. B(d,2d) = d, is true for d "
schema:exampleOfWork<http://worldcat.org/entity/work/id/137126237>
schema:inLanguage"en"
schema:name"The d-step conjecture for polyhedra of dimension d<6."
schema:numberOfPages"47"
schema:publisher
rdf:typeschema:Organization
schema:name"Defense Technical Information Center"

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.