Here we investigate a variety of ways to represent polytopes and related objects. We define a class of posets, which includes all abstract polytopes, giving a unique representative among posets having a particular labeled flag graph and characterize the labeled flag graphs of abstract polytopes. We show that determining the realizability of an abstract polytope is equivalent to solving a low rank matrix completion problem. For any given polytope, we provide a new construction for the known result that there is a combinatorial polytope with a specified ridge that is always projectively equivalent to the given polytope, and we show how this makes a naturally arising subclass of intractable problems tractable. We give necessary and sufficient conditions for realizing a polytope's interval poset, which is the polytopal analog of a poset's Hasse diagram. We then provide a counter example to the general realizablity of a polytope's interval poset. / Mathematics
| Identifer | oai:union.ndltd.org:TEMPLE/oai:scholarshare.temple.edu:20.500.12613/1109 |
| Date | January 2011 |
| Creators | Dobbins, Michael Gene |
| Contributors | Rivin, Igor, Futer, David, Pollack, Richard, Szyld, Daniel, Theran, Louis |
| Publisher | Temple University. Libraries |
| Source Sets | Temple University |
| Language | English |
| Detected Language | English |
| Type | Thesis/Dissertation, Text |
| Format | 114 pages |
| Rights | IN COPYRIGHT- This Rights Statement can be used for an Item that is in copyright. Using this statement implies that the organization making this Item available has determined that the Item is in copyright and either is the rights-holder, has obtained permission from the rights-holder(s) to make their Work(s) available, or makes the Item available under an exception or limitation to copyright (including Fair Use) that entitles it to make the Item available., http://rightsstatements.org/vocab/InC/1.0/ |
| Relation | http://dx.doi.org/10.34944/dspace/1091, Theses and Dissertations |
Page generated in 0.0015 seconds