DOCSLIB.ORG

Cutting Planes and Integrality of Polyhedra: Structure and Complexity

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Cutting Planes and Integrality of Polyhedra: Structure and Complexity Cutting Planes and Integrality of Polyhedra: Structure and Complexity by Dabeen Lee A thesis submitted to Carnegie Mellon University in fulfillment of the thesis requirement for the degree of Doctor of Philosophy in Algorithms, Combinatorics, and Optimization Pittsburgh, Pennsylvania, USA, 2019 c Dabeen Lee 2019 Examining Committee Membership The following served on the Examining Committee for this thesis. External Examiners: William J. Cook, Professor Department of Applied Mathematics and Statistics Johns Hopkins University Sanjeeb Dash, Research Staff Member Department of Mathematical Sciences IBM Thomas J. Watson Research Center Supervisor: G´erardCornu´ejols,Professor Tepper School of Business Carnegie Mellon University Internal Members: Anupam Gupta, Professor School of Computer Science Carnegie Mellon University R Ravi, Professor Tepper School of Business Carnegie Mellon University ii Author's Declaration This thesis consists of material all of which I authored or co-authored: see Statement of Contributions included in the thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. iii Statement of Contributions This thesis is based on various collaborations with Ahmad Abdi, G´erardCornu´ejols,Sanjeeb Dash, Oktay G¨unl¨uk,Nat´aliaGuri˘canov´aand Yanjun Li. These include, but are not limited to, papers [2,4,5,6, 36, 37, 53, 91]. iv Abstract In this thesis, we study theoretical aspects of integer linear programming. This thesis consists of two main parts: the first part is on the theory of cutting planes for integer linear programming, while the second part is on the theory of ideal clutters in combinatorial optimization. Cutting planes for an integer linear program are linear inequalities that are valid for all integer feasible solutions but possibly violated by some solutions to the linear programming relaxation. The Chv´atal- Gomory cuts, introduced by Gomory in 1958 and further studied by Chv´atalin 1973 in relation to their applications in combinatorial optimization, are one of the simplest types of cutting planes. The split cuts are another class of cutting planes that are important in modern integer linear programming. The first part of this thesis discusses our recent developments in the theory of Chv´atal-Gomorycuts and split cuts. We study rational polyhedra with Chv´atalrank 1, rational polyhedra with split rank 1, some sufficient conditions under which a rational polytope in the 0,1 hypercube has small Chv´atalrank, and a generalization of the Chv´atalclosure. Let E be a finite set of elements, and let C be a family of subsets of E called members. We say that C is a clutter over ground set E if no member contains another. We say that the clutter C is ideal if the P system (xe : e 2 C) ≥ 1 8C 2 C; xe ≥ 0 8e 2 E defines an integral polyhedron. One can find rich classes of ideal clutters that arise in combinatorial optimization: the clutter of st-paths, the clutter of T -joins, the clutter of dijoins, the clutter of the odd circuits of a weakly bipartite graph, etc. As these wide range of examples suggest, characterizing when a clutter is ideal is still a major open question in integer programming and combinatorial optimization. One of the conjectures that were made to understand the question is the τ = 2 Conjecture by Cornu´ejols,Guenin, and Margot in 2000. In the second part of this thesis, we study and develop tools to solve the τ = 2 Conjecture. We introduce intersecting clutters and multipartite clutters and study two equivalent versions of the τ = 2 Conjecture stated in terms of intersecting clutters and multipartite clutters. v Acknowledgements First of all, I would like to thank my Ph.D. advisor G´erardCornu´ejolsfor his continuous support, patience, and encouragement. Without his support, I would not have been able to finish this long Ph.D. journey. I am always grateful and feel fortunate to have G´erardas my advisor, and I have been happy to learn integer programming and combinatorial optimization from him and work on exciting projects together. I must thank Ahmad Abdi, who has always been an inspiring colleague and a close friend. Ahmad dragged me into the field of ideal clutters, and he has patiently taught me the theory of ideal clutters from basics to modern research questions. I am lucky to collaborate with Ahmad, and joint works with him led to one half of this thesis. I am also greatly indebted to Sanjeeb Dash and Oktay G¨unl¨ukat IBM T.J. Watson Research Center for the great internship opportunity, and I am lucky to have them as my mentors. I would also like to thank coauthors Nat´aliaGuri˘canov´aand Yanjun Li. It was great 5 years in Pittsburgh with my classmates at CMU, Michael Anastos, Gerdus Benade, Nam Ho-Nguyen, and Ryo Kimura. Lastly, I want to thank the members of Korean Central Church of Pittsburgh for including me as part of the church and for being a family to me. vi Dedication I dedicate this thesis to my parents. vii Table of Contents 1 Introduction 1 1.1 Preliminaries: the Chv´atalclosure and the split clousre....................3 1.2 Rational polytopes with rank 1..................................4 1.3 Polytopes in the 0,1 hypercube that have small Chv´atalrank.................6 1.4 Generalized Chv´atalclosure....................................8 1.5 Preliminaries: ideal clutters....................................9 1.6 Intersecting restrictions in clutters................................ 13 1.7 Multipartite clutters and the τ = 2 Conjecture......................... 16 1.8 Multipartite clutters of bounded degree............................. 19 1.9 The reflective product....................................... 20 1.10 Ideal vector spaces......................................... 22 2 Polytopes with Chvatal rank 1 26 2.1 Easy cases.............................................. 27 2.2 Recognizing rational polytopes with an empty Chv´atalclosure is NP-hard.......... 32 2.2.1 The case of polytopes contained in the unit hypercube................. 32 2.2.2 The case of simplices.................................... 36 2.2.3 Optimization and separation over Chv´atalclosure................... 42 2.2.4 Deciding whether adding a certain number of Chv´atal-Gomorycuts can yield the integer hull......................................... 42 2.3 Flatness theorem for closed convex sets with empty Chv´atalclosure............. 44 2.3.1 Flatness result....................................... 46 2.3.2 Proof of Theorem 2.19................................... 48 2.3.3 A Lenstra-type algorithm................................. 51 viii 3 Polytopes with split rank 1 53 3.1 Deciding whether the split closure of a rational polytope is empty is NP-hard........ 53 3.1.1 Reduction from Equality Knapsack............................ 54 3.1.2 Implications......................................... 58 3.2 Flatness theorem for rational polytopes of split rank 1..................... 59 3.3 Further notes............................................ 61 4 Polytopes in the 0,1 hypercube that have small Chv´atalrank 62 4.1 Basic tools.............................................. 63 4.2 The Chv´atalrank of QS ...................................... 64 4.2.1 Chv´atalrank 1....................................... 64 4.2.2 Chv´atalrank 2....................................... 65 4.2.3 Chv´atalrank 3....................................... 66 4.2.4 Chv´atalrank 4....................................... 68 4.3 Vertex cutsets............................................ 73 4.3.1 Cut vertex......................................... 73 4.3.2 2-vertex cut......................................... 76 4.4 Graphs of tree width 2....................................... 80 4.5 Proof of Theorem 1.14....................................... 84 5 Generalized Chv´atalclosure 86 5.1 Preliminaries............................................ 87 5.2 S-Chv´atalclosure for finite number of integer points...................... 90 5.3 Integer points in a cylinder.................................... 91 5.4 Integer points with bounds on components............................ 96 5.4.1 Covering polyhedra..................................... 99 5.4.2 Packing polyhedra..................................... 109 5.5 Proof of Theorem 1.16....................................... 114 5.6 Further notes............................................ 116 6 Intersecting restrictions in clutters 117 6.1 Finding an intersecting restriction................................ 117 6.2 Finding a delta and the blocker of an extended odd hole minor................ 120 6.3 Further notes............................................ 125 ix 7 Multipartite clutters 126 7.1 Multipartite clutters and the τ = 2 Conjecture......................... 127 7.2 Induced clutters.......................................... 130 7.3 Multipartite clutters of bounded degree............................. 133 7.4 A pseudocode to generate strictly polar multipartite clutters that do not pack........ 139 7.5 Further notes............................................ 143 8 The reflective product 144 8.1 Products and coproducts of clutters............................... 145 8.2 Products and reflective products of sets............................. 146 8.3 Minimally non-packing multipartite clutters obtained by the reflective product....... 148 8.4 Further notes............................................ 155 9 Ideal vector spaces 157 9.1 Theorem 1.50 for when the characteristic of GF (q) is not 2.................
Load more

Recommended publications
  • 7 LATTICE POINTS and LATTICE POLYTOPES Alexander Barvinok
    7 LATTICE POINTS AND LATTICE POLYTOPES Alexander Barvinok INTRODUCTION Lattice polytopes arise naturally in algebraic geometry, analysis, combinatorics, computer science, number theory, optimization, probability and representation the- ory. They possess a rich structure arising from the interaction of algebraic, convex, analytic, and combinatorial properties. In this chapter, we concentrate on the the- ory of lattice polytopes and only sketch their numerous applications. We briefly discuss their role in optimization and polyhedral combinatorics (Section 7.1). In Section 7.2 we discuss the decision problem, the problem of finding whether a given polytope contains a lattice point. In Section 7.3 we address the counting problem, the problem of counting all lattice points in a given polytope. The asymptotic problem (Section 7.4) explores the behavior of the number of lattice points in a varying polytope (for example, if a dilation is applied to the polytope). Finally, in Section 7.5 we discuss problems with quantifiers. These problems are natural generalizations of the decision and counting problems. Whenever appropriate we address algorithmic issues. For general references in the area of computational complexity/algorithms see [AB09]. We summarize the computational complexity status of our problems in Table 7.0.1. TABLE 7.0.1 Computational complexity of basic problems. PROBLEM NAME BOUNDED DIMENSION UNBOUNDED DIMENSION Decision problem polynomial NP-hard Counting problem polynomial #P-hard Asymptotic problem polynomial #P-hard∗ Problems with quantifiers unknown; polynomial for ∀∃ ∗∗ NP-hard ∗ in bounded codimension, reduces polynomially to volume computation ∗∗ with no quantifier alternation, polynomial time 7.1 INTEGRAL POLYTOPES IN POLYHEDRAL COMBINATORICS We describe some combinatorial and computational properties of integral polytopes.
    [Show full text]
  • Combinatorial and Discrete Problems in Convex Geometry
    COMBINATORIAL AND DISCRETE PROBLEMS IN CONVEX GEOMETRY A dissertation submitted to Kent State University in partial fulfillment of the requirements for the degree of Doctor of Philosophy by Matthew R. Alexander September, 2017 Dissertation written by Matthew R. Alexander B.S., Youngstown State University, 2011 M.A., Kent State University, 2013 Ph.D., Kent State University, 2017 Approved by Dr. Artem Zvavitch , Co-Chair, Doctoral Dissertation Committee Dr. Matthieu Fradelizi , Co-Chair Dr. Dmitry Ryabogin , Members, Doctoral Dissertation Committee Dr. Fedor Nazarov Dr. Feodor F. Dragan Dr. Jonathan Maletic Accepted by Dr. Andrew Tonge , Chair, Department of Mathematical Sciences Dr. James L. Blank , Dean, College of Arts and Sciences TABLE OF CONTENTS LIST OF FIGURES . vi ACKNOWLEDGEMENTS ........................................ vii NOTATION ................................................. viii I Introduction 1 1 This Thesis . .2 2 Preliminaries . .4 2.1 Convex Geometry . .4 2.2 Basic functions and their properties . .5 2.3 Classical theorems . .6 2.4 Polarity . .8 2.5 Volume Product . .8 II The Discrete Slicing Problem 11 3 The Geometry of Numbers . 12 3.1 Introduction . 12 3.2 Lattices . 12 3.3 Minkowski's Theorems . 14 3.4 The Ehrhart Polynomial . 15 4 Geometric Tomography . 17 4.1 Introduction . 17 iii 4.2 Projections of sets . 18 4.3 Sections of sets . 19 4.4 The Isomorphic Busemann-Petty Problem . 20 5 The Discrete Slicing Problem . 22 5.1 Introduction . 22 5.2 Solution in Z2 ............................................. 23 5.3 Approach via Discrete F. John Theorem . 23 5.4 Solution using known inequalities . 26 5.5 Solution for Unconditional Bodies . 27 5.6 Discrete Brunn's Theorem .
    [Show full text]
  • Classification of Ehrhart Polynomials of Integral Simplices Akihiro Higashitani
    Classification of Ehrhart polynomials of integral simplices Akihiro Higashitani To cite this version: Akihiro Higashitani. Classification of Ehrhart polynomials of integral simplices. 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), 2012, Nagoya, Japan. pp.587-594. hal-01283113 HAL Id: hal-01283113 https://hal.archives-ouvertes.fr/hal-01283113 Submitted on 5 Mar 2016 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. FPSAC 2012, Nagoya, Japan DMTCS proc. AR, 2012, 587–594 Classification of Ehrhart polynomials of integral simplices Akihiro Higashitani y Department of Pure and Applied Mathematics, Graduate School of Information Science and Technology, Osaka University, Toyonaka, Osaka 560-0043, Japan Abstract. Let δ(P) = (δ0; δ1; : : : ; δd) be the δ-vector of an integral convex polytope P of dimension d. First, by Pd using two well-known inequalities on δ-vectors, we classify the possible δ-vectors with i=0 δi ≤ 3. Moreover, by Pd means of Hermite normal forms of square matrices, we also classify the possible δ-vectors with i=0 δi = 4. In Pd Pd addition, for i=0 δi ≥ 5, we characterize the δ-vectors of integral simplices when i=0 δi is prime.
    [Show full text]
  • Unimodular Triangulations of Dilated 3-Polytopes
    Trudy Moskov. Matem. Obw. Trans. Moscow Math. Soc. Tom 74 (2013), vyp. 2 2013, Pages 293–311 S 0077-1554(2014)00220-X Article electronically published on April 9, 2014 UNIMODULAR TRIANGULATIONS OF DILATED 3-POLYTOPES F. SANTOS AND G. M. ZIEGLER Abstract. A seminal result in the theory of toric varieties, by Knudsen, Mumford and Waterman (1973), asserts that for every lattice polytope P there is a positive integer k such that the dilated polytope kP has a unimodular triangulation. In dimension 3, Kantor and Sarkaria (2003) have shown that k = 4 works for every polytope. But this does not imply that every k>4 works as well. We here study the values of k for which the result holds, showing that: (1) It contains all composite numbers. (2) It is an additive semigroup. These two properties imply that the only values of k that may not work (besides 1 and 2, which are known not to work) are k ∈{3, 5, 7, 11}.Withanad-hocconstruc- tion we show that k =7andk = 11 also work, except in this case the triangulation cannot be guaranteed to be “standard” in the boundary. All in all, the only open cases are k =3andk =5. § 1. Introduction Let Λ ⊂ Rd be an affine lattice. A lattice polytope (or an integral polytope [4]) is a polytope P with all its vertices in Λ. We are particularly interested in lattice (full- dimensional) simplices. The vertices of a lattice simplex Δ are an affine basis for Rd, hence they induce a sublattice ΛΔ of Λ of index equal to the normalized volume of Δ with respect to Λ.
    [Show full text]
  • The $ H^* $-Polynomial of the Order Polytope of the Zig-Zag Poset
    THE h∗-POLYNOMIAL OF THE ORDER POLYTOPE OF THE ZIG-ZAG POSET JANE IVY COONS AND SETH SULLIVANT Abstract. We describe a family of shellings for the canonical tri- angulation of the order polytope of the zig-zag poset. This gives a new combinatorial interpretation for the coefficients in the numer- ator of the Ehrhart series of this order polytope in terms of the swap statistic on alternating permutations. 1. Introduction and Preliminaries The zig-zag poset Zn on ground set {z1,...,zn} is the poset with exactly the cover relations z1 < z2 > z3 < z4 > . That is, this partial order satisfies z2i−1 < z2i and z2i > z2i+1 for all i between n−1 1 and ⌊ 2 ⌋. The order polytope of Zn, denoted O(Zn) is the set n of all n-tuples (x1,...,xn) ∈ R that satisfy 0 ≤ xi ≤ 1 for all i and xi ≤ xj whenever zi < zj in Zn. In this paper, we introduce the “swap” permutation statistic on alternating permutations to give a new combinatorial interpretation of the numerator of the Ehrhart series of O(Zn). We began studying this problem in relation to combinatorial proper- ties of the Cavender-Farris-Neyman model with a molecular clock (or CFN-MC model) from mathematical phylogenetics [4]. We were inter- ested in the polytope associated to the toric variety obtained by ap- plying the discrete Fourier transform to the Cavender-Farris-Neyman arXiv:1901.07443v2 [math.CO] 1 Apr 2020 model with a molecular clock on a given rooted binary phylogenetic tree. We call this polytope the CFN-MC polytope.
    [Show full text]
  • Triangulations of Integral Polytopes, Examples and Problems
    数理解析研究所講究録 955 巻 1996 年 133-144 133 Triangulations of integral polytopes, examples and problems Jean-Michel KANTOR We are interested in polytopes in real space of arbitrary dimension, having vertices with integral co- ordinates: integral polytopes. The recent increase of interest for the study of these $\mathrm{p}\mathrm{o}\mathrm{l}\mathrm{y}$ topes and their triangulations has various motivations; let us mention the main ones: . the beautiful theory of toric varieties has built a bridge between algebraic geometry and the combina- torics of these integral polytopes [12]. Triangulations of cones and polytopes occur naturally for example in problems of existence of crepant resolution of singularities $[1,5]$ . The work of the school of $\mathrm{I}.\mathrm{M}$ . Gelfand on secondary polytopes gives a new insight on triangulations, with applications to algebraic geometry and group theory [13]. In statistical physics, random tilings lead to some interesting problems dealing with triangulations of order polytopes $[6,29]$ . With these motivations in mind, we introduce new tools: Generalizations of the Ehrhart polynomial (counting points “modulo congruence”), discrete length between integral points (and studying the geometry associated to it), arithmetic Euler-Poincar\'e formula which gives, in dimension 3, the Ehrhart polynomial in terms of the $\mathrm{f}$-vector of a minimal triangulation of the polytope (Theorem 7). Finally, let us mention the results in dimension 2 of the late Peter Greenberg, they led us to the study of “Arithmetical $\mathrm{P}\mathrm{L}$-topology” which, we believe with M. Gromov, D. Sullivan, and P. Vogel, has not yet revealed all its beauties.
    [Show full text]
  • Arxiv:1904.05974V3 [Cs.DS] 11 Jul 2019
    Quasi-popular Matchings, Optimality, and Extended Formulations Yuri Faenza1 and Telikepalli Kavitha2? 1 IEOR, Columbia University, New York, USA. [email protected] 2 Tata Institute of Fundamental Research, Mumbai, India. [email protected] Abstract. Let G = (A [ B; E) be an instance of the stable marriage problem where every vertex ranks its neighbors in a strict order of preference. A matching M in G is popular if M does not lose a head-to-head election against any matching N. That is, φ(M; N) ≥ φ(N; M) where φ(M; N) (similarly, φ(N; M)) is the number of votes for M (resp., N) in the M-vs-N election. Popular matchings are a well- studied generalization of stable matchings, introduced with the goal of enlarging the set of admissible solutions, while maintaining a certain level of fairness. Every stable matching is a popular matching of minimum size. Unfortunately, it is NP-hard to find a popular matching of minimum cost, when a linear cost function is given on the edge set – even worse, the min-cost popular matching problem is hard to approximate up to any factor. Let opt be the cost of a min-cost popular matching. Our goal is to efficiently compute a matching of cost at most opt by paying the price of mildly relaxing popularity. Call a matching M quasi-popular if φ(M; N) ≥ φ(N; M)=2 for every matching N. Our main positive result is a bi-criteria algorithm that finds in polynomial time a quasi-popular matching of cost at most opt.
    [Show full text]
  • LMS Undergraduate Summer School 2016 the Many Faces of Polyhedra
    LMS Undergraduate Summer School 2016 The many faces of polyhedra 1. Pick's theorem 2 2 Let L = Z ⊂ R be integer lattice, P be polygon with vertices in L (integral polygon) Figure 1. An example of integral polygon Let I and B be the number of lattice points in the interior of P and on its boundary respectively. In the example shown above I = 4; B = 12. Pick's theorem. For any integral polygon P its area A can be given by Pick's formula B (1) A = I + - 1: 2 12 In particular, in our example A = 4 + 2 - 1 = 9, which can be checked directly. The following example (due to Reeve) shows that no such formula can be found for polyhedra. Consider the tetrahedron Th with vertices (0; 0; 0); (1; 0; 0); (0; 1; 0); (1; 1; h), h 2 Z (Reeve's tetrahedron, see Fig. 2). Figure 2. Reeve's tetrahedron Th It is easy to see that Th has no interior lattice points and 4 lattice points on the boundary, but its volume is Vol(Th) = h=6: 2 2. Ehrhart theory d Let P ⊂ R be an integral convex polytope, which can be defined as the convex hull of its vertices v1; : : : ; vN 2 d Z : P = fx1v1 + : : : xNvN; x1 + : : : xN = 1; xi ≥ 0g: For d = 2 and d = 3 we have convex polygon and convex polyhedron respectively. Define d LP(t) := jtP \ Z j; which is the number of lattice points in the scaled polytope tP; t 2 Z: Ehrhart theorem. LP(t) is a polynomial in t of degree d with rational coefficients and with highest coefficient being volume of P: d LP(t) = Vol(P)t + ··· + 1: LP(t) is called Ehrhart polynomial.
    [Show full text]
  • Berline-Vergne Valuation and Generalized Permutohedra
    BERLINE-VERGNE VALUATION AND GENERALIZED PERMUTOHEDRA FEDERICO CASTILLO AND FU LIU Abstract. Generalizing a conjecture by De Loera et al., we conjecture that integral gen- eralized permutohedra all have positive Ehrhart coefficients. Berline and Vergne construct a valuation that assigns values to faces of polytopes, which provides a way to write Ehrhart coefficients of a polytope as positive sums of these values. Based on available results, we pose a stronger conjecture: Berline-Vergne’s valuation is always positive on permutohedra, which implies our first conjecture. This article proves that our strong conjecture on Berline-Vergne’s valuation is true for dimension up to 6, and is true if we restrict to faces of codimension up to 3. In addition to investigating the positivity conjectures, we study the Berline-Vergne’s valuation, and show that it is the unique construction for McMullen’s formula used to describe number of lattice points in permutohedra under certain symmetry constraints. We also give an equivalent statement to the strong conjecture in terms of mixed valuations. 1. Introduction A lattice point is a point in ZD. Given any bounded set S ⊆ RD, we let Lat(S) := |S ∩ZD| be the number of lattice points in S. Given a polytope P in RD, a natural enumerative problem is to compute Lat(P ). In this paper, we will focus on integral polytopes, i.e., poly- topes whose vertices are all lattice points, and generalized permutohedra – a special family of polytopes. 1.1. Motivation: Ehrhart positivity for generalized permutohedra. One approach to study the question of computing Lat(P ) for an integral polytope P is to consider a more general counting problem: For any nonnegative integer t, let tP := {tx | x ∈ P } be the t-th dilation of P , and then consider the function i(P, t) := Lat(tP ) arXiv:1509.07884v2 [math.CO] 15 Oct 2017 that counts the number of lattice points in tP.
    [Show full text]
  • Forbidden Vertices
    Forbidden vertices Gustavo Angulo*, Shabbir Ahmed*, Santanu S. Dey*, Volker Kaibel† September 8, 2013 Abstract In this work, we introduce and study the forbidden-vertices problem. Given a polytope P and a subset X of its vertices, we study the complexity of linear optimization over the subset of vertices of P that are not contained in X. This problem is closely related to finding the k-best basic solutions to a linear problem. We show that the complexity of the problem changes significantly depending on the encoding of both P and X. We provide additional tractability results and extended formula- tions when P has binary vertices only. Some applications and extensions to integral polytopes are discussed. 1 Introduction Given a nonempty rational polytope P ⊆ Rn, we denote by vert(P ), faces(P ), and facets(P ) the sets of vertices, faces, and facets of P , respectively, and we write f(P ) := jfacets(P )j. We also denote by xc(P ) the extension complexity of P , that is, the minimum number of inequalities in any linear extended formulation of P , i.e., a description of a polyhedron whose image under a linear map is P . Finally, given a set X ⊆ vert(P ), we define forb(P; X) := conv(vert(P )nX), where conv(S) denotes the convex hull of S ⊆ Rn. This work is devoted to understanding the complexity of the forbidden-vertices problem defined below. Definition 1. Given a polytope P ⊆ Rn, a set X ⊆ vert(P ), and a vector c 2 Rn, the forbidden-vertices problem is to either assert vert(P ) n X = ?, or to return a minimizer of c>x over vert(P ) n X otherwise.
    [Show full text]
  • Ehrhart Positivity
    Ehrhart Positivity Federico Castillo University of California, Davis Joint work with Fu Liu December 15, 2016 Federico Castillo UC Davis Ehrhart Positivity An integral polytope is a polytope whose vertices are all lattice points. i.e., points with integer coordinates. Definition For any polytope P ⊂ Rd and positive integer m 2 N; the mth dilation of P is mP = fmx : x 2 Pg: We define d i(P; m) = jmP \ Z j to be the number of lattice points in the mP: Lattice points of a polytope A (convex) polytope is a bounded solution set of a finite system of linear inequalities, or is the convex hull of a finite set of points. Federico Castillo UC Davis Ehrhart Positivity Definition For any polytope P ⊂ Rd and positive integer m 2 N; the mth dilation of P is mP = fmx : x 2 Pg: We define d i(P; m) = jmP \ Z j to be the number of lattice points in the mP: Lattice points of a polytope A (convex) polytope is a bounded solution set of a finite system of linear inequalities, or is the convex hull of a finite set of points. An integral polytope is a polytope whose vertices are all lattice points. i.e., points with integer coordinates. Federico Castillo UC Davis Ehrhart Positivity Lattice points of a polytope A (convex) polytope is a bounded solution set of a finite system of linear inequalities, or is the convex hull of a finite set of points. An integral polytope is a polytope whose vertices are all lattice points. i.e., points with integer coordinates.
    [Show full text]
  • The Order Polytope of Young's Lattice
    Bennet Goeckner GRWC 2019 Problem Proposal 1 The order polytope of Young's lattice 1 Background In [Sta86], Stanley defined the order polytope of a poset. Definition 1.1. Given a finite poset (P; ≤) with P = fp1; : : : ; png, its order polytope O(P ) is n all points x = (x1; : : : ; xn) 2 R such that 0 ≤ xi ≤ 1 for all pi 2 P and xi ≤ xj whenever pi < pj. n th Given a polytope P ⊆ R with integer vertices, its m dilate is mP = fmx j x 2 Pg. Its Ehrhart polynomial is n iP (m) := jmP\ Z j i.e., it is the number of integer points in the mth dilate of P. The Ehrhart series of P is X m EhrP (t) = iP (m)t : m≥0 It is well known that the Ehrhart series of an n-dimensional integral polytope P can be written h∗(t) Ehr (t) = P (1 − t)n+1 where h∗(t) is known as the h∗-polynomial of P. Stanley showed that the the Ehrhart polynomial of an order polytope O(P ) is directly related to the order polynomial of P . The order polynomial of P is ΩP (m), the number of order-preserving maps f : P ! f1; : : : ; mg. In particular, Stanley showed that iO(P )(m) = ΩP (m + 1) [Sta86, Theorem 4.1]. Young's lattice is the poset Y of all integer partitions ordered under inclusion of Young diagrams. The Hasse diagram of part of Young's lattice, stolen used appropriately from Wikipedia. Bennet Goeckner GRWC 2019 Problem Proposal 2 2 Questions Stanley's original paper has spawned numerous subsequent papers, including generalizations of order polytopes to other objects (e.g.
    [Show full text]