Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 282 for “"polytopes"”.
-
Thurston Polytopes
We explore a 3-manifold and link invariant called the Thurston norm which provides a deep understanding of the submanifold structure of a 3-manifold. Recently, methods to compute the Thurston norm ball (a symmetric rational polytope) have been developed, providing a doorway through which we can …
-
Thurston Polytopes
We explore a 3-manifold and link invariant called the Thurston norm which provides a deep understanding of the submanifold structure of a 3-manifold. Recently, methods to compute the Thurston norm ball (a symmetric rational polytope) have been developed, providing a doorway through which we can …
-
Sign Matrix Polytopes
Motivated by the study of polytopes formed as the convex hull of permutation matrices and alternating sign matrices, several new families of polytopes are defined as convex hulls of sign matrices, which are certain {0,1,-1}--matrices in bijection with semistandard Young tableaux. This bijection is …
-
Representations of Polytopes
… 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 …
-
Graphs of Polytopes
… polytope. Several problems concerning graphs of polytopes are discussed. The primary result is a set of bounds (Theorem 39) on the maximal size of an anticlique (sometimes called a coclique, stable set, or independent set) of the graph of a polytope based on its dimension and number of vertices. …
-
Faces of Polytopes
… of this thesis are about face numbers of polytopes. In Chapter 1, we settle a question of B\'ar\'any from the 1990s: do all convex $d$-polytopes satisfy $f_0, \ldots, f_{d-1} \geq \min\{f_0,f_{d-1}\}$? We answer ``yes" and prove a stronger statement: for all convex $d$-polytopes and …
-
Constructions for Chiral Polytopes
Abstract polytopes are combinatorial structures obeying certain axioms that generalise both classical convex geometric polytopes (like the Platonic solids) and maps on surfaces (such as Klein’s quartic). Of particular interest are the polytopes with maximal possible symmetry subject to certain …
-
Oriented Matroid Circuit Polytopes
… give rise to several natural constructions of polytopes. Inspired by this, we examine polytopes that arise from the signed circuits of an oriented matroid. We give the dimensions of these polytopes arising from graphical oriented matroids and their duals. Moreover, we consider polytopes …
-
Combinatorics of poset polytopes
… partially ordered set (a poset for short) and polytopes constructed from it: order polytopes and chain polytopes. We study correspondences between parts of the poset and faces of the polytopes. We compare these two polytopes to each other and prove inequalities between their f-vectors. We study …
-
Separators of simple polytopes
… showed that all the graphs of three dimensional polytopes have separators of size $O(\sqrt{n})$. In higher dimensions no such result is possible, as there are polytopes that have a complete graph as their graph. The graphs of simple $d$-polytopes are regular with degree $d$. Kalai had …
-
Classifying Strictly Tessellating Polytopes
… restrictions and lattices. Strictly tessellating polytopes are defined and used in connection to the main theorem. The paper concludes by formulating a conjecture akin to Fuglede’s, replacing tessellation by translaton with strict tessellation. In addition to the paper, results on the geometric …
-
Polytopes of minimal circuit diameter
… diameter using circuits, of certain polytopes, focusing on when the circuit diameter is small and what criteria for small circuit diameter exist. Such classifications of polytopes with small circuit diameter may indicate when a circuit-based optimization algorithm would be preferred. …
-
Reach Control Problems on Polytopes
As control systems become more integrated with high-end engineering systems as well as consumer products, they are expected to achieve specifications that may include logic rules, safety constraints, startup procedures, and so forth. Control design for such complex specifications is a relatively …
-
Polytopes, scattering amplitudes, and cohomology
… be interpreted as volumes of complex projective polytopes in some sense, and here we give this interpretation explicit meaning. In doing so, we uncover a novel calculus for calculating the volumes of such polytopes. This calculus can be used on the polytopes corresponding to these BCFW …
-
Inscribable polytopes via Delaunay triangulations
Die Arbeit behandelt einschreibbare simpliziale Polytope und insbesondere deren f-Vektoren. Durch Konstruktion spezieller Delaunay Triangulierungen zeigt der Autor folgende Hauptresultate: Zu jedem simplizialen Polytop gibt es ein eingeschriebenes simpliziales Polytop gleicher Dimension, das gleich …
-
Covering properties of lattice polytopes
… problems concerning the interaction between polytopes and lattices. Motivation for the study of lattice polytopes comes from two very different fields: discrete optimization, in particular integer linear programming, and algebraic geometry, specifically the study of toric varieties. The first …
-
Lattice Polytopes - Applications and Properties
… is about applications and properties of lattice polytopes. In the second chapter, we briefly review the necessary background material. In Chapter 3, we examine proper colorings of a special family of graphs. This family is described by the Cartesian graph product of an arbitrary graph and a path …
-
Polytopes with few coordinate values
… this thesis we introduce (0,1,a)- and (0,1,a_i)-polytopes and explore their various combinatorial properties. These polytopes are generalizations of (0,1)-polytopes, which arise as fundamental objects of combinatorial optimization and linear programming. While $(0,1)$-polytopes can be described …
-
Realization spaces of polytopes and matroids
… by slack matrices, and a model which represents polytopes by their Gale transforms. We explore the connections between these models, and show how they can be exploited to obtain useful parametrizations of the slack realization space. Chapter 2 introduces a natural model for the realization space …
Page 1 of 15