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 19 of 19 for “"Lattice Polytopes"”.

  1. 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 …

    fu-berlin Repository record for Covering properties of lattice polytopes (opens in a new tab)

  2. 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 …

    fu-berlin Repository record for Lattice Polytopes - Applications and Properties (opens in a new tab)

  3. Lattice polytopes with distinct pair-sums

    Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2012-11-12T15:48:22Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Milos_Curcic.pdf: 1736474 bytes, checksum: 78919c2db9cb41bd6fc66699c7c32e46 (MD5)

    uiuc Repository record for Lattice polytopes with distinct pair-sums (opens in a new tab)

  4. Ehrhart Theory and Unimodular Decompositions of Lattice Polytopes

    Ehrhart theory studies the behaviour of lattice points contained in dilates of lattice polytopes. We provide an introduction to Ehrhart theory. In particular, we prove Ehrhart's Theorem, Stanley Non-negativity, and Ehrhart-Macdonald Reciprocity via lattice triangulations. We also introduce the …

    waterloo Repository record for Ehrhart Theory and Unimodular Decompositions of Lattice Polytopes (opens in a new tab)

  5. Discrete Geometry and Optimization Approaches for Lattice Polytopes

    … to solve linear optimization instances. A lattice (d,k)-polytope is the convex hull of a set of points whose coordinates are integer ranging from 0 to k. This dissertation provides new insights into the determination of the largest possible diameter δ(d,k) over all possible lattice …

    mcmaster Repository record for Discrete Geometry and Optimization Approaches for Lattice Polytopes (opens in a new tab)

  6. Geometric and Combinatorial Properties of Lattice Polytopes Defined from Graphs

    Polytopes are geometric objects that generalize polygons in the plane and polyhedra in 3-dimensional space. Of particular interest in geometric combinatorics are families of lattice polytopes defined from combinatorial objects, such as graphs. In particular, this dissertation studies symmetric edge …

    uky-thes Repository record for Geometric and Combinatorial Properties of Lattice Polytopes Defined from Graphs (opens in a new tab)

  7. Combinatorial Optimization and Discrete Geometry Approaches for Half-Integral Polytopes

    … dimension. Research on the maximum diameter of polytopes has usually considered polytopes in terms of the dimension and the number of facets, and for polytopes with integer vertices, in terms of their dimension and the range of the coordinates of their vertices. In this thesis, we aim to combine …

    toronto-retro Repository record for Combinatorial Optimization and Discrete Geometry Approaches for Half-Integral Polytopes (opens in a new tab)

  8. Geometric Properties of Weighted Projective Space Simplices

    … the interplay between three properties of lattice polytopes: reflexivity, the integer decomposition property (IDP), and the unimodality of Ehrhart h*-vectors. Motivated by this conjecture, this dissertation explores geometric properties of weighted projective space simplices, a class of …

    uky-thes Repository record for Geometric Properties of Weighted Projective Space Simplices (opens in a new tab)

  9. Three interesting lattice polytope problems

    … suggests, this thesis is about three interesting lattice polytope problems. Chapter 2 is about classifying lattice polytopes and we show that in every dimension d there is a number W(d), called the finiteness threshold width, such that there are only finitely many lattice polytopes of bounded size …

    fu-berlin Repository record for Three interesting lattice polytope problems (opens in a new tab)

  10. Polytopes Associated to Graph Laplacians

    … provide interesting ways to generate families of lattice polytopes. In particular, one can use matrices encoding the information of a finite graph to define vertices of a polytope. This dissertation initiates the study of the Laplacian simplex, PG, obtained from a finite graph G by taking the …

    uky-thes Repository record for Polytopes Associated to Graph Laplacians (opens in a new tab)

  11. Unimodality Questions in Ehrhart Theory

    … problem in Ehrhart theory is to classify those lattice polytopes having a unimodal h*-vector.Although various sufficient conditions have been found, necessary conditions remain a challenge. Highly-structured polytopes, such as the polytope of real doubly-stochastic matrices, have been proven to …

    uky-thes Repository record for Unimodality Questions in Ehrhart Theory (opens in a new tab)

  12. Fine Polyhedral Adjunction, Weighted Ehrhart Theory, and Tensor Network Varieties

    … studies combinatorial structures such as lattice polytopes, and binary trees, their interaction with (toric) algebraic geometry and classification problems from a combinatorial point of view. In the Introduction presented in Chapter 1 we begin by collecting all the main results from this …

    fu-berlin Repository record for Fine Polyhedral Adjunction, Weighted Ehrhart Theory, and Tensor Network Varieties (opens in a new tab)

  13. Algebraic and combinatorial aspects of group-based models

    … we can associate discrete structures, such as lattice polytopes and affine semigroups, with group-based models. We follow three main lines in this dissertation. In Chapters 2 and 3, we study the Hilbert polynomials of group-based models. This is motivated by a result of Buczyńska and Wiśniewski …

    fu-berlin Repository record for Algebraic and combinatorial aspects of group-based models (opens in a new tab)

  14. Computational and Geometric Aspects of Linear Optimization

    … assumptions. In the first part, we consider lattice (d,k)-polytopes; that is, the convex hull of a set of points drawn from {0,1,...,k}^d, and study the largest possible diameter, delta(d,k), that a lattice (d,k)- polytope can achieve. We present novel properties and an enumeration algorithm …

    mcmaster Repository record for Computational and Geometric Aspects of Linear Optimization (opens in a new tab)

  15. New methods for fixed-margin binary matrix sampling, Fréchet covariance, and MANOVA tests for random objects in multiple metric spaces

    … of integer partitions and points in convex lattice polytopes. The second broad approach we explore is comparing random objects in metric spaces lacking a coordinate system. Traditional definitions of the mean and variance no longer apply, and standard statistical tests have needed …

    colostate Repository record for New methods for fixed-margin binary matrix sampling, Fréchet covariance, and MANOVA tests for random objects in multiple metric spaces (opens in a new tab)

  16. On Face Vector Sets and on Alcoved Polytopes

    … with the sets of f-vectors and flag vectors of polytopes. A new result is the complete description of the projection of the set of flag vectors of 4-dimensional polytopes onto the entries f0, the number of vertices, and f03, the number of vertex-facet incidences. Further new results are the …

    fu-berlin Repository record for On Face Vector Sets and on Alcoved Polytopes (opens in a new tab)