View Item 

Show simple item record

Cutting a polytope

dc.contributor.authorJockusch, Williamen_US
dc.contributor.authorPrabhu, Nagabhushanaen_US
dc.date.accessioned2006-09-08T20:45:08Z
dc.date.available2006-09-08T20:45:08Z
dc.date.issued1995-03en_US
dc.identifier.citationJockusch, William; Prabhu, Nagabhushana; (1995). "Cutting a polytope." Geometriae Dedicata 54(3): 307-312. <http://hdl.handle.net/2027.42/42814>en_US
dc.identifier.issn0046-5755en_US
dc.identifier.issn1572-9168en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/42814
dc.description.abstractWe investigate whether it is the case that for every convex d -polytope P and pair of distinct vertices x and y of P , there exists a hyperplane passing through x and y which cuts P into two smaller d -polytopes, one of which has fewer facets than P . Such a result would lead to inductive proofs of Conjectures 1 and 2 below. However, for d ≥4, our answer is in the negative.en_US
dc.format.extent355409 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherKluwer Academic Publishers; Springer Science+Business Mediaen_US
dc.subject.otherMathematicsen_US
dc.subject.otherGeometryen_US
dc.subject.otherPrimary 52en_US
dc.subject.otherSecondary 05en_US
dc.titleCutting a polytopeen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumUniversity of Michigan, 48109, Ann Arbor, MI, USAen_US
dc.contributor.affiliationotherPurdue University, 47907, West Lafayette, IN, USAen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/42814/1/10711_2005_Article_BF01265345.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/BF01265345en_US
dc.identifier.sourceGeometriae Dedicataen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
10711_2005_Article_BF01265345.pdf
Size:
347.0KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.