Sökning: "polytopes"
Visar resultat 1 - 5 av 15 avhandlingar innehållade ordet polytopes.
1. Classifying Lattice Polytopes
Sammanfattning : This thesis consists of two papers in toric geometry. In Paper A we provide a complete classification up to isomorphism of all smooth convex lattice 3- polytopes with at most 16 lattice points. There exist in total 103 different polytopes meeting these criteria. LÄS MER
2. Multidimensional Piecewise Regular Arrays
Sammanfattning : Regular arrays, particularly systolic arrays, have been the subject of continuous interest for the past 15 years. One reason is that they present an excellent example of the unity between hardware and software, especially for application-specific computations. LÄS MER
3. Causal Combinatorics : Edges of the Characteristic Imset Polytopes
Sammanfattning : Explaining data in a concise and efficient manner has become increasingly important in today's society. This thesis pertains to the problem of finding causal links within data, and how that can be done from a mathematical perspective. Using the framework of graphical models has several advantages, from interpretability to efficiency. LÄS MER
4. Enumeration on words, complexes and polytopes
Sammanfattning : This thesis presents four papers, studying enumerative problems on combinatorial structures. The first paper studies Forman's discrete Morse theory in the case where a group acts on the underlying complex. LÄS MER
5. Classifications and volume bounds of lattice polytopes
Sammanfattning : In this licentiate thesis we study relations among invariants of lattice polytopes, with particular focus on bounds for the volume.In the first paper we give an upper bound on the volume vol(P^*) of a polytope P^* dual to a d-dimensional lattice polytope P with exactly one interiorlattice point, in each dimension d. LÄS MER
