Gelfand-Tsetlin Polytopes

Size: px
Start display at page:

Download "Gelfand-Tsetlin Polytopes"

Transcription

1 Gelfand-Tsetlin Polytopes Per Alexandersson, September 2014 Based on Gelfand-Tsetlin patterns, integrally closedness and compressed polytopes, arxiv:

2 Skew Gelfand-Tsetlin patterns A Gelfand-Tsetlin pattern, or GT-patterns for short, is a triangular or parallelogram arrangement of non-negative numbers, x m 1 x m 2 x m n satisfying x 2 1 x 2 2 x 2 n x 1 1 x 1 2 x 1 n x i+1 j x i j and x i j x i+1 j+1 for all values of i, j where the indexing is defined.

3 A bijection The skew shape defined by row j and j + 1 in a GT-pattern G describes which boxes in a tableau T that have content j. In particular, if the bottom row in G is µ and the top row is λ, then T has shape λ/µ. Here is an example of this correspondence:

4 The concatenation operator The operator denotes the elementwise addition of GT-patterns. Hence, the -sum of any two Young tableaux is a new Young tableau. Observation: Every skew semi-standard Young tableaux of shape kλ/kµ can be decomposed as k tableaux of shape λ/µ: = Here, λ/µ = (4, 3, 3, 1)/(2, 1) and k =

5 Gelfand-Tsetlin polytopes Consider an m n GT-pattern, with top and bottom row λ resp. µ. The GT-inequalities defines a convex polytope, P λ/µ R mn. The integer points in P λ/µ corresponds to the Young tableaux with shape λ/µ, where the entries are in the set 1, 2,..., m 1.

6 Gelfand-Tsetlin polytopes Consider an m n GT-pattern, with top and bottom row λ resp. µ. The GT-inequalities defines a convex polytope, P λ/µ R mn. The integer points in P λ/µ corresponds to the Young tableaux with shape λ/µ, where the entries are in the set 1, 2,..., m 1. The observation that a tableau of shape kλ/kµ can be represented as a -sum of k tableaux of shape λ/µ corresponds to P λ/µ being integrally closed.

7 Integrally closed polytopes A convex polytope P is integrally closed if for every positive integer k and integer point p kp, there are integer points p j P such that p = p 1 + p p k

8 Integrally closed polytopes A convex polytope P is integrally closed if for every positive integer k and integer point p kp, there are integer points p j P such that p = p 1 + p p k All integrally closed polytopes are integral, that is, all vertices of the polytope are integer points. Hence all P λ/µ are integral.

9 Gelfand-Tsetlin polytopes II Warning: New notation! Let P λ/µ,w be the Gelfand-Tsetlin polytope defined by the same inequalities and equalities before, with the addition that the sum of the entries in row j resp. row j + 1 in the pattern differ by exactly w j.

10 Gelfand-Tsetlin polytopes II Warning: New notation! Let P λ/µ,w be the Gelfand-Tsetlin polytope defined by the same inequalities and equalities before, with the addition that the sum of the entries in row j resp. row j + 1 in the pattern differ by exactly w j Here, w = (2, 2, 1, 1) and w is the type of the tableau; w j counts the number of boxes with content j.

11 Properties of P λ/µ,w The GT-polytopes P λ/µ,w have strange properties.

12 Properties of P λ/µ,w The GT-polytopes P λ/µ,w have strange properties. Some P λ/µ,w are non-integral, (King, Tollu, Toumazet, 2004). All P λ/µ,w have polynomial Ehrhart function, (Rassart, 2004).

13 Properties of P λ/µ,w The GT-polytopes P λ/µ,w have strange properties. Some P λ/µ,w are non-integral, (King, Tollu, Toumazet, 2004). All P λ/µ,w have polynomial Ehrhart function, (Rassart, 2004). Let w be a permutation of the entries in w. Then P λ/µ,w might be integral while P λ/µ,w is non-integral. The number of integer points in P λ/µ,w and P λ/µ,w are always the same.

14 Main conjectures Conjecture All integral P λ/µ,w are integrally closed.

15 Main conjectures Conjecture All integral P λ/µ,w are integrally closed. Let P λ/µ,w be the convex hull of the integer points in P λ/µ,w. Note P λ/µ,w P λ/µ,w.

16 Main conjectures Conjecture All integral P λ/µ,w are integrally closed. Let P λ/µ,w be the convex hull of the integer points in P λ/µ,w. Note P λ/µ,w P λ/µ,w. Conjecture All Pλ/µ,w are integrally closed.

17 Results so far (arxiv: ) Theorem (A. 2014) All Pλ/µ,1 are compressed. This implies integrally closedness. Note that the polytope Pλ/µ,1 is always non-empty and that integer points in this polytope correspond to standard Young tableaux of shape λ/µ. An integral polytope is compressed if all pulling triangulations are unimodular. Corollary: All integral points in Pλ/µ,1 are vertices.

18 Special cases Proposition (A. 2014) If λ/µ is a skew Young diagram without any 2 2-arrangement of boxes, then P λ/µ,w is integral and integrally closed.

19 Special cases Proposition (A. 2014) If λ/µ is a skew Young diagram without any 2 2-arrangement of boxes, then P λ/µ,w is integral and integrally closed. Proposition (A. 2014) P λ,1 is non-integral whenever λ 1 λ 2 > λ 3 1.

20 Refinement results Partial order < ref with respect to composition refinements of w: Proposition (A. 2014) Let w < ref w and let P = P λ/µ,w R d and P = P λ/µ,w R d. Then 1. P Z d is greater or equal to P Z d. (Trivial) 2. If P is empty, then P is empty. (Trivial) 3. If P is integral, then P is integral. 4. If P is integrally closed, then so is P. Conjecture 5. If P is a unimodular simplex, then P is a unimodular simplex.

21 (Part of the) general picture Non-skew case λ = 431, and w in the boxes

22 Further questions 1. Are all coefficient in the Ehrhart polynomials obtained from P λ/µ,w and P λ/µ,w non-negative?

23 Further questions 1. Are all coefficient in the Ehrhart polynomials obtained from P λ/µ,w and P λ/µ,w non-negative? 2. The Gelfand-Tsetlin patterns discussed here are associated with Lie algebras of type A n. There are polytopes similar to GT-polytopes for other types. Same phenomenon?

24 Further questions 1. Are all coefficient in the Ehrhart polynomials obtained from P λ/µ,w and P λ/µ,w non-negative? 2. The Gelfand-Tsetlin patterns discussed here are associated with Lie algebras of type A n. There are polytopes similar to GT-polytopes for other types. Same phenomenon? 3. The Littlewood-Richardson coefficients can also be interpreted as the number of integer points in certain polytopes, for example BZ-polytopes or hive polytopes. Same phenomenon here?

25 Further questions 1. Are all coefficient in the Ehrhart polynomials obtained from P λ/µ,w and P λ/µ,w non-negative? 2. The Gelfand-Tsetlin patterns discussed here are associated with Lie algebras of type A n. There are polytopes similar to GT-polytopes for other types. Same phenomenon? 3. The Littlewood-Richardson coefficients can also be interpreted as the number of integer points in certain polytopes, for example BZ-polytopes or hive polytopes. Same phenomenon here? 4. Hint about Kronecker coefficients?

26 The end Thank you for your time

GELFAND TSETLIN POLYTOPES AND THE INTEGER DECOMPOSITION PROPERTY arxiv: v4 [math.co] 25 Nov 2015

GELFAND TSETLIN POLYTOPES AND THE INTEGER DECOMPOSITION PROPERTY arxiv: v4 [math.co] 25 Nov 2015 GELFAND TSETLIN POLYTOPES AND THE INTEGER DECOMPOSITION PROPERTY arxiv:4478v4 [mathco] Nov PER ALEXANDERSSON Abstract Let P be the Gelfand Tsetlin polytope defined by the skew shape λ/µ and weight w In

More information

Semistandard Young Tableaux Polytopes. Sara Solhjem Joint work with Jessica Striker. April 9, 2017

Semistandard Young Tableaux Polytopes. Sara Solhjem Joint work with Jessica Striker. April 9, 2017 Semistandard Young Tableaux Polytopes Sara Solhjem Joint work with Jessica Striker North Dakota State University Graduate Student Combinatorics Conference 217 April 9, 217 Sara Solhjem (NDSU) Semistandard

More information

Noncrossing sets and a Graßmann associahedron

Noncrossing sets and a Graßmann associahedron Noncrossing sets and a Graßmann associahedron Francisco Santos, Christian Stump, Volkmar Welker (in partial rediscovering work of T. K. Petersen, P. Pylyavskyy, and D. E. Speyer, 2008) (in partial rediscovering

More information

arxiv:math/ v1 [math.co] 30 Oct 1998

arxiv:math/ v1 [math.co] 30 Oct 1998 arxiv:math/9810180v1 [math.co] 30 Oct 1998 THE SATURATION CONJECTURE (AFTER A. KNUTSON AND T. TAO) ANDERS SKOVSTED BUCH The purpose of this exposition 1 is to give a simple and complete treatment of Knutson

More information

Interval-Vector Polytopes

Interval-Vector Polytopes Interval-Vector Polytopes Jessica De Silva Gabriel Dorfsman-Hopkins California State University, Stanislaus Dartmouth College Joseph Pruitt California State University, Long Beach July 28, 2012 Abstract

More information

arxiv: v1 [math.co] 25 Sep 2015

arxiv: v1 [math.co] 25 Sep 2015 A BASIS FOR SLICING BIRKHOFF POLYTOPES TREVOR GLYNN arxiv:1509.07597v1 [math.co] 25 Sep 2015 Abstract. We present a change of basis that may allow more efficient calculation of the volumes of Birkhoff

More information

Classification of Ehrhart quasi-polynomials of half-integral polygons

Classification of Ehrhart quasi-polynomials of half-integral polygons Classification of Ehrhart quasi-polynomials of half-integral polygons A thesis presented to the faculty of San Francisco State University In partial fulfilment of The Requirements for The Degree Master

More information

Essential bases, semigroups and toric degenerations

Essential bases, semigroups and toric degenerations Ghislain Fourier SFB meeting, 27.09.2018 1 17 pages until lunch break Essential bases, semigroups and toric degenerations Annual meeting SFB/TRR 195 27.09.2018, Tübingen Ghislain Fourier Ghislain Fourier

More information

Linear Programming Terminology

Linear Programming Terminology Linear Programming Terminology The carpenter problem is an example of a linear program. T and B (the number of tables and bookcases to produce weekly) are decision variables. The profit function is an

More information

Section Notes 5. Review of Linear Programming. Applied Math / Engineering Sciences 121. Week of October 15, 2017

Section Notes 5. Review of Linear Programming. Applied Math / Engineering Sciences 121. Week of October 15, 2017 Section Notes 5 Review of Linear Programming Applied Math / Engineering Sciences 121 Week of October 15, 2017 The following list of topics is an overview of the material that was covered in the lectures

More information

4. Simplicial Complexes and Simplicial Homology

4. Simplicial Complexes and Simplicial Homology MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n

More information

Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices. Matthias Beck & Serkan Hoşten San Francisco State University

Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices. Matthias Beck & Serkan Hoşten San Francisco State University Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck & Serkan Hoşten San Francisco State University math.sfsu.edu/beck Math Research Letters Growth Series of Lattices L R d lattice

More information

3 No-Wait Job Shops with Variable Processing Times

3 No-Wait Job Shops with Variable Processing Times 3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select

More information

DM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini

DM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini DM545 Linear and Integer Programming Lecture 2 The Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. 4. Standard Form Basic Feasible Solutions

More information

Lecture 12 March 4th

Lecture 12 March 4th Math 239: Discrete Mathematics for the Life Sciences Spring 2008 Lecture 12 March 4th Lecturer: Lior Pachter Scribe/ Editor: Wenjing Zheng/ Shaowei Lin 12.1 Alignment Polytopes Recall that the alignment

More information

Lattice-point generating functions for free sums of polytopes

Lattice-point generating functions for free sums of polytopes Lattice-point generating functions for free sums of polytopes Tyrrell B. McAllister 1 Joint work with Matthias Beck 2 and Pallavi Jayawant 3 1 University of Wyoming 2 San Francisco State University 3 Bates

More information

Polytopes With Large Signature

Polytopes With Large Signature Polytopes With Large Signature Joint work with Michael Joswig Nikolaus Witte TU-Berlin / TU-Darmstadt witte@math.tu-berlin.de Algebraic and Geometric Combinatorics, Anogia 2005 Outline 1 Introduction Motivation

More information

The important function we will work with is the omega map ω, which we now describe.

The important function we will work with is the omega map ω, which we now describe. 20 MARGARET A. READDY 3. Lecture III: Hyperplane arrangements & zonotopes; Inequalities: a first look 3.1. Zonotopes. Recall that a zonotope Z can be described as the Minkowski sum of line segments: Z

More information

Characterizing Automorphism and Permutation Polytopes

Characterizing Automorphism and Permutation Polytopes Characterizing Automorphism and Permutation Polytopes By KATHERINE EMILIE JONES BURGGRAF SENIOR THESIS Submitted in partial satisfaction of the requirements for Highest Honors for the degree of BACHELOR

More information

MA4254: Discrete Optimization. Defeng Sun. Department of Mathematics National University of Singapore Office: S Telephone:

MA4254: Discrete Optimization. Defeng Sun. Department of Mathematics National University of Singapore Office: S Telephone: MA4254: Discrete Optimization Defeng Sun Department of Mathematics National University of Singapore Office: S14-04-25 Telephone: 6516 3343 Aims/Objectives: Discrete optimization deals with problems of

More information

Combinatorial Geometry & Topology arising in Game Theory and Optimization

Combinatorial Geometry & Topology arising in Game Theory and Optimization Combinatorial Geometry & Topology arising in Game Theory and Optimization Jesús A. De Loera University of California, Davis LAST EPISODE... We discuss the content of the course... Convex Sets A set is

More information

Toric Cohomological Rigidity of Simple Convex Polytopes

Toric Cohomological Rigidity of Simple Convex Polytopes Toric Cohomological Rigidity of Simple Convex Polytopes Dong Youp Suh (KAIST) The Second East Asian Conference on Algebraic Topology National University of Singapore December 15-19, 2008 1/ 28 This talk

More information

Advanced Operations Research Techniques IE316. Quiz 2 Review. Dr. Ted Ralphs

Advanced Operations Research Techniques IE316. Quiz 2 Review. Dr. Ted Ralphs Advanced Operations Research Techniques IE316 Quiz 2 Review Dr. Ted Ralphs IE316 Quiz 2 Review 1 Reading for The Quiz Material covered in detail in lecture Bertsimas 4.1-4.5, 4.8, 5.1-5.5, 6.1-6.3 Material

More information

Discrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity

Discrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity Discrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity Marc Uetz University of Twente m.uetz@utwente.nl Lecture 5: sheet 1 / 26 Marc Uetz Discrete Optimization Outline 1 Min-Cost Flows

More information

Lecture 2 - Introduction to Polytopes

Lecture 2 - Introduction to Polytopes Lecture 2 - Introduction to Polytopes Optimization and Approximation - ENS M1 Nicolas Bousquet 1 Reminder of Linear Algebra definitions Let x 1,..., x m be points in R n and λ 1,..., λ m be real numbers.

More information

The Simplex Algorithm. Chapter 5. Decision Procedures. An Algorithmic Point of View. Revision 1.0

The Simplex Algorithm. Chapter 5. Decision Procedures. An Algorithmic Point of View. Revision 1.0 The Simplex Algorithm Chapter 5 Decision Procedures An Algorithmic Point of View D.Kroening O.Strichman Revision 1.0 Outline 1 Gaussian Elimination 2 Satisfiability with Simplex 3 General Simplex Form

More information

Classification of smooth Fano polytopes

Classification of smooth Fano polytopes Classification of smooth Fano polytopes Mikkel Øbro PhD thesis Advisor: Johan Peder Hansen September 2007 Department of Mathematical Sciences, Faculty of Science University of Aarhus Introduction This

More information

1 Elementary number theory

1 Elementary number theory Math 215 - Introduction to Advanced Mathematics Spring 2019 1 Elementary number theory We assume the existence of the natural numbers and the integers N = {1, 2, 3,...} Z = {..., 3, 2, 1, 0, 1, 2, 3,...},

More information

Lecture notes on the simplex method September We will present an algorithm to solve linear programs of the form. maximize.

Lecture notes on the simplex method September We will present an algorithm to solve linear programs of the form. maximize. Cornell University, Fall 2017 CS 6820: Algorithms Lecture notes on the simplex method September 2017 1 The Simplex Method We will present an algorithm to solve linear programs of the form maximize subject

More information

maximize c, x subject to Ax b,

maximize c, x subject to Ax b, Lecture 8 Linear programming is about problems of the form maximize c, x subject to Ax b, where A R m n, x R n, c R n, and b R m, and the inequality sign means inequality in each row. The feasible set

More information

Legal and impossible dependences

Legal and impossible dependences Transformations and Dependences 1 operations, column Fourier-Motzkin elimination us use these tools to determine (i) legality of permutation and Let generation of transformed code. (ii) Recall: Polyhedral

More information

Convex Geometry arising in Optimization

Convex Geometry arising in Optimization Convex Geometry arising in Optimization Jesús A. De Loera University of California, Davis Berlin Mathematical School Summer 2015 WHAT IS THIS COURSE ABOUT? Combinatorial Convexity and Optimization PLAN

More information

h-polynomials of triangulations of flow polytopes (Cornell University)

h-polynomials of triangulations of flow polytopes (Cornell University) h-polynomials of triangulations of flow polytopes Karola Mészáros (Cornell University) h-polynomials of triangulations of flow polytopes (and of reduction trees) Karola Mészáros (Cornell University) Plan

More information

Polytopes Course Notes

Polytopes Course Notes Polytopes Course Notes Carl W. Lee Department of Mathematics University of Kentucky Lexington, KY 40506 lee@ms.uky.edu Fall 2013 i Contents 1 Polytopes 1 1.1 Convex Combinations and V-Polytopes.....................

More information

arxiv: v1 [math.co] 27 Feb 2015

arxiv: v1 [math.co] 27 Feb 2015 Mode Poset Probability Polytopes Guido Montúfar 1 and Johannes Rauh 2 arxiv:1503.00572v1 [math.co] 27 Feb 2015 1 Max Planck Institute for Mathematics in the Sciences, Inselstraße 22, 04103 Leipzig, Germany,

More information

Point-Set Topology II

Point-Set Topology II Point-Set Topology II Charles Staats September 14, 2010 1 More on Quotients Universal Property of Quotients. Let X be a topological space with equivalence relation. Suppose that f : X Y is continuous and

More information

Independence for Exchange Graphs and Cluster Complexes

Independence for Exchange Graphs and Cluster Complexes Independence for Exchange Graphs and Cluster Complexes P.-G. Plamondon October 29, 2012 Joint work with G. Cerulli Irelli, B. Keller, D. Labardini-Fragoso. 1 Exchange Graphs and Cluster Complexes Setting:

More information

Modeling and Analysis of Hybrid Systems

Modeling and Analysis of Hybrid Systems Modeling and Analysis of Hybrid Systems Convex polyhedra Prof. Dr. Erika Ábrahám Informatik 2 - LuFG Theory of Hybrid Systems RWTH Aachen University Szeged, Hungary, 27 September - 06 October 2017 Ábrahám

More information

Modeling and Analysis of Hybrid Systems

Modeling and Analysis of Hybrid Systems Modeling and Analysis of Hybrid Systems 6. Convex polyhedra Prof. Dr. Erika Ábrahám Informatik 2 - LuFG Theory of Hybrid Systems RWTH Aachen University Szeged, Hungary, 27 September - 06 October 2017 Ábrahám

More information

Integer Programming Theory

Integer Programming Theory Integer Programming Theory Laura Galli October 24, 2016 In the following we assume all functions are linear, hence we often drop the term linear. In discrete optimization, we seek to find a solution x

More information

The simplex method and the diameter of a 0-1 polytope

The simplex method and the diameter of a 0-1 polytope The simplex method and the diameter of a 0-1 polytope Tomonari Kitahara and Shinji Mizuno May 2012 Abstract We will derive two main results related to the primal simplex method for an LP on a 0-1 polytope.

More information

Mutation-linear algebra and universal geometric cluster algebras

Mutation-linear algebra and universal geometric cluster algebras Mutation-linear algebra and universal geometric cluster algebras Nathan Reading NC State University Mutation-linear ( µ-linear ) algebra Universal geometric cluster algebras The mutation fan Universal

More information

Split-Cuts and the Stable Set Polytope of Quasi-Line Graphs

Split-Cuts and the Stable Set Polytope of Quasi-Line Graphs Split-Cuts and the Stable Set Polytope of Quasi-Line Graphs Friedrich Eisenbrand Joint work with G. Oriolo, P. Ventura and G. Stauffer Gomory cutting planes P = {x n Ax b} polyhedron, c T x δ, c n valid

More information

PBW and toric degenerations of flag varieties

PBW and toric degenerations of flag varieties PBW and toric degenerations of flag varieties Ghislain Fourier University of Glasgow - Universität Bonn DFG-Schwerpunkt 1388, Bad Honnef 2015 Fourier 1/ 18 The Setup Let us introduce the main objects in

More information

Monotone Paths in Geometric Triangulations

Monotone Paths in Geometric Triangulations Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation

More information

arxiv:math.co/ v1 7 Jul 2005

arxiv:math.co/ v1 7 Jul 2005 PERMUTOHEDRA, ASSOCIAHEDRA, AND BEYOND ALEXANDER POSTNIKOV arxiv:math.co/050763 v 7 Jul 005 Abstract. The volume and the number of lattice points of the permutohedron P n are given by certain multivariate

More information

Proposition 1. The edges of an even graph can be split (partitioned) into cycles, no two of which have an edge in common.

Proposition 1. The edges of an even graph can be split (partitioned) into cycles, no two of which have an edge in common. Math 3116 Dr. Franz Rothe June 5, 2012 08SUM\3116_2012t1.tex Name: Use the back pages for extra space 1 Solution of Test 1.1 Eulerian graphs Proposition 1. The edges of an even graph can be split (partitioned)

More information

arxiv: v2 [math.co] 24 Aug 2016

arxiv: v2 [math.co] 24 Aug 2016 Slicing and dicing polytopes arxiv:1608.05372v2 [math.co] 24 Aug 2016 Patrik Norén June 23, 2018 Abstract Using tropical convexity Dochtermann, Fink, and Sanyal proved that regular fine mixed subdivisions

More information

Linear programming and duality theory

Linear programming and duality theory Linear programming and duality theory Complements of Operations Research Giovanni Righini Linear Programming (LP) A linear program is defined by linear constraints, a linear objective function. Its variables

More information

SIMION S TYPE B ASSOCIAHEDRON IS A PULLING TRIANGULATION OF THE LEGENDRE POLYTOPE

SIMION S TYPE B ASSOCIAHEDRON IS A PULLING TRIANGULATION OF THE LEGENDRE POLYTOPE SIMION S TYPE B ASSOCIAHEDRON IS A PULLING TRIANGULATION OF THE LEGENDRE POLYTOPE RICHARD EHRENBORG, GÁBOR HETYEI AND MARGARET READDY Abstract. We show that the Simion type B associahedron is combinatorially

More information

POLYTOPES. Grünbaum and Shephard [40] remarked that there were three developments which foreshadowed the modern theory of convex polytopes.

POLYTOPES. Grünbaum and Shephard [40] remarked that there were three developments which foreshadowed the modern theory of convex polytopes. POLYTOPES MARGARET A. READDY 1. Lecture I: Introduction to Polytopes and Face Enumeration Grünbaum and Shephard [40] remarked that there were three developments which foreshadowed the modern theory of

More information

3. The Simplex algorithmn The Simplex algorithmn 3.1 Forms of linear programs

3. The Simplex algorithmn The Simplex algorithmn 3.1 Forms of linear programs 11 3.1 Forms of linear programs... 12 3.2 Basic feasible solutions... 13 3.3 The geometry of linear programs... 14 3.4 Local search among basic feasible solutions... 15 3.5 Organization in tableaus...

More information

POLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if

POLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if POLYHEDRAL GEOMETRY Mathematical Programming Niels Lauritzen 7.9.2007 Convex functions and sets Recall that a subset C R n is convex if {λx + (1 λ)y 0 λ 1} C for every x, y C and 0 λ 1. A function f :

More information

The Simplex Algorithm

The Simplex Algorithm The Simplex Algorithm Uri Feige November 2011 1 The simplex algorithm The simplex algorithm was designed by Danzig in 1947. This write-up presents the main ideas involved. It is a slight update (mostly

More information

Vertex-Maximal Lattice Polytopes Contained in 2-Simplices

Vertex-Maximal Lattice Polytopes Contained in 2-Simplices Vertex-Maximal Lattice Polytopes Contained in 2-Simplices Christoph Pegel Institut für Algebra, Zahlentheorie und Diskrete Mathematik Leibniz Universität Hannover November 14, 2018 joint with Jan Philipp

More information

CREPANT RESOLUTIONS OF GORENSTEIN TORIC SINGULARITIES AND UPPER BOUND THEOREM. Dimitrios I. Dais

CREPANT RESOLUTIONS OF GORENSTEIN TORIC SINGULARITIES AND UPPER BOUND THEOREM. Dimitrios I. Dais Séminaires & Congrès 6, 2002, p. 187 192 CREPANT RESOLUTIONS OF GORENSTEIN TORIC SINGULARITIES AND UPPER BOUND THEOREM by Dimitrios I. Dais Abstract. A necessary condition for the existence of torus-equivariant

More information

arxiv: v1 [math.co] 15 Dec 2009

arxiv: v1 [math.co] 15 Dec 2009 ANOTHER PROOF OF THE FACT THAT POLYHEDRAL CONES ARE FINITELY GENERATED arxiv:092.2927v [math.co] 5 Dec 2009 VOLKER KAIBEL Abstract. In this note, we work out a simple inductive proof showing that every

More information

Cell-Like Maps (Lecture 5)

Cell-Like Maps (Lecture 5) Cell-Like Maps (Lecture 5) September 15, 2014 In the last two lectures, we discussed the notion of a simple homotopy equivalences between finite CW complexes. A priori, the question of whether or not a

More information

Discrete Volume Computations. for Polyhedra

Discrete Volume Computations. for Polyhedra Digital Discrete Volume Computations y for Polyhedra 20 Matthias Beck San Francisco State University math.sfsu.edu/beck DGCI 2016 5 x z 2 Science is what we understand well enough to explain to a computer,

More information

Linear Programming. Readings: Read text section 11.6, and sections 1 and 2 of Tom Ferguson s notes (see course homepage).

Linear Programming. Readings: Read text section 11.6, and sections 1 and 2 of Tom Ferguson s notes (see course homepage). Linear Programming Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory: Feasible Set, Vertices, Existence of Solutions. Equivalent formulations. Outline

More information

Linear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued.

Linear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued. Linear Programming Widget Factory Example Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory:, Vertices, Existence of Solutions. Equivalent formulations.

More information

Locally convex topological vector spaces

Locally convex topological vector spaces Chapter 4 Locally convex topological vector spaces 4.1 Definition by neighbourhoods Let us start this section by briefly recalling some basic properties of convex subsets of a vector space over K (where

More information

THE REFLEXIVE DIMENSION OF A LATTICE POLYTOPE

THE REFLEXIVE DIMENSION OF A LATTICE POLYTOPE DUKE-CGTP-04-07 THE REFLEXIVE DIMENSION OF A LATTICE POLYTOPE CHRISTIAN HAASE AND ILARION V. MELNIKOV Abstract. The reflexive dimension refldim(p ) of a lattice polytope P is the minimal d so that P is

More information

arxiv:math/ v1 [math.at] 18 Oct 2005

arxiv:math/ v1 [math.at] 18 Oct 2005 arxiv:math/0510380v1 [math.at] 18 Oct 2005 PARKING FUNCTIONS AND TRIANGULATION OF THE ASSOCIAHEDRON JEAN-LOUIS LODAY Abstract. We show that a minimal triangulation of the associahedron (Stasheff polytope)

More information

Lecture 9: Linear Programming

Lecture 9: Linear Programming Lecture 9: Linear Programming A common optimization problem involves finding the maximum of a linear function of N variables N Z = a i x i i= 1 (the objective function ) where the x i are all non-negative

More information

A Course in Convexity

A Course in Convexity A Course in Convexity Alexander Barvinok Graduate Studies in Mathematics Volume 54 American Mathematical Society Providence, Rhode Island Preface vii Chapter I. Convex Sets at Large 1 1. Convex Sets. Main

More information

Convexity: an introduction

Convexity: an introduction Convexity: an introduction Geir Dahl CMA, Dept. of Mathematics and Dept. of Informatics University of Oslo 1 / 74 1. Introduction 1. Introduction what is convexity where does it arise main concepts and

More information

Linear Programming in Small Dimensions

Linear Programming in Small Dimensions Linear Programming in Small Dimensions Lekcija 7 sergio.cabello@fmf.uni-lj.si FMF Univerza v Ljubljani Edited from slides by Antoine Vigneron Outline linear programming, motivation and definition one dimensional

More information

N-flips in 3-dimensional Small Cove Transformation Groups and Combinato. 数理解析研究所講究録別冊 = RIMS Kokyuroku Bessa (2013), B39:

N-flips in 3-dimensional Small Cove Transformation Groups and Combinato. 数理解析研究所講究録別冊 = RIMS Kokyuroku Bessa (2013), B39: Title N-flips in 3-dimensional Small Cove Transformation Groups and Combinato Author(s) NISHIMURA, Yasuzo Citation 数理解析研究所講究録別冊 = RIMS Kokyuroku Bessa (2013), B39: 137-148 Issue Date 2013-04 URL http://hdl.handle.net/2433/207819

More information

FACES OF CONVEX SETS

FACES OF CONVEX SETS FACES OF CONVEX SETS VERA ROSHCHINA Abstract. We remind the basic definitions of faces of convex sets and their basic properties. For more details see the classic references [1, 2] and [4] for polytopes.

More information

Part 4. Decomposition Algorithms Dantzig-Wolf Decomposition Algorithm

Part 4. Decomposition Algorithms Dantzig-Wolf Decomposition Algorithm In the name of God Part 4. 4.1. Dantzig-Wolf Decomposition Algorithm Spring 2010 Instructor: Dr. Masoud Yaghini Introduction Introduction Real world linear programs having thousands of rows and columns.

More information

Well labeled paths and the volume of a polytope

Well labeled paths and the volume of a polytope Well labeled paths and the volume of a polytope Philippe Nadeau (Joint work with Olivier Bernardi and Bertrand Duplantier) Fakultät für Mathematik Universität Wien SLC 62, Heilsbronn February 24th, 2009

More information

SIMION S TYPE B ASSOCIAHEDRON IS A PULLING TRIANGULATION OF THE LEGENDRE POLYTOPE

SIMION S TYPE B ASSOCIAHEDRON IS A PULLING TRIANGULATION OF THE LEGENDRE POLYTOPE SIMION S TYPE B ASSOCIAHEDRON IS A PULLING TRIANGULATION OF THE LEGENDRE POLYTOPE RICHARD EHRENBORG, GÁBOR HETYEI AND MARGARET READDY Abstract. We show that Simion s type B associahedron is combinatorially

More information

Simplex Algorithm in 1 Slide

Simplex Algorithm in 1 Slide Administrivia 1 Canonical form: Simplex Algorithm in 1 Slide If we do pivot in A r,s >0, where c s

More information

Mathematical and Algorithmic Foundations Linear Programming and Matchings

Mathematical and Algorithmic Foundations Linear Programming and Matchings Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis

More information

arxiv: v1 [math.co] 12 Dec 2017

arxiv: v1 [math.co] 12 Dec 2017 arxiv:1712.04381v1 [math.co] 12 Dec 2017 Semi-reflexive polytopes Tiago Royer Abstract The Ehrhart function L P(t) of a polytope P is usually defined only for integer dilation arguments t. By allowing

More information

Pebble Sets in Convex Polygons

Pebble Sets in Convex Polygons 2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon

More information

However, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example).

However, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example). 98 CHAPTER 3. PROPERTIES OF CONVEX SETS: A GLIMPSE 3.2 Separation Theorems It seems intuitively rather obvious that if A and B are two nonempty disjoint convex sets in A 2, then there is a line, H, separating

More information

CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension

CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension Antoine Vigneron King Abdullah University of Science and Technology November 7, 2012 Antoine Vigneron (KAUST) CS 372 Lecture

More information

PERMUTOHEDRA, ASSOCIAHEDRA, AND BEYOND

PERMUTOHEDRA, ASSOCIAHEDRA, AND BEYOND PERMUTOHEDRA, ASSOCIAHEDRA, AND BEYOND ALEXANDER POSTNIKOV Abstract. The volume and the number of lattice points of the permutohedron P n are given by certain multivariate polynomials that have remarkable

More information

EC 521 MATHEMATICAL METHODS FOR ECONOMICS. Lecture 2: Convex Sets

EC 521 MATHEMATICAL METHODS FOR ECONOMICS. Lecture 2: Convex Sets EC 51 MATHEMATICAL METHODS FOR ECONOMICS Lecture : Convex Sets Murat YILMAZ Boğaziçi University In this section, we focus on convex sets, separating hyperplane theorems and Farkas Lemma. And as an application

More information

Improved Gomory Cuts for Primal Cutting Plane Algorithms

Improved Gomory Cuts for Primal Cutting Plane Algorithms Improved Gomory Cuts for Primal Cutting Plane Algorithms S. Dey J-P. Richard Industrial Engineering Purdue University INFORMS, 2005 Outline 1 Motivation The Basic Idea Set up the Lifting Problem How to

More information

Some Advanced Topics in Linear Programming

Some Advanced Topics in Linear Programming Some Advanced Topics in Linear Programming Matthew J. Saltzman July 2, 995 Connections with Algebra and Geometry In this section, we will explore how some of the ideas in linear programming, duality theory,

More information

Math 414 Lecture 30. The greedy algorithm provides the initial transportation matrix.

Math 414 Lecture 30. The greedy algorithm provides the initial transportation matrix. Math Lecture The greedy algorithm provides the initial transportation matrix. matrix P P Demand W ª «2 ª2 «W ª «W ª «ª «ª «Supply The circled x ij s are the initial basic variables. Erase all other values

More information

What is a cone? Anastasia Chavez. Field of Dreams Conference President s Postdoctoral Fellow NSF Postdoctoral Fellow UC Davis

What is a cone? Anastasia Chavez. Field of Dreams Conference President s Postdoctoral Fellow NSF Postdoctoral Fellow UC Davis What is a cone? Anastasia Chavez President s Postdoctoral Fellow NSF Postdoctoral Fellow UC Davis Field of Dreams Conference 2018 Roadmap for today 1 Cones 2 Vertex/Ray Description 3 Hyperplane Description

More information

9 Bounds for the Knapsack Problem (March 6)

9 Bounds for the Knapsack Problem (March 6) 9 Bounds for the Knapsack Problem (March 6) In this lecture, I ll develop both upper and lower bounds in the linear decision tree model for the following version of the (NP-complete) Knapsack 1 problem:

More information

Optimization of Design. Lecturer:Dung-An Wang Lecture 8

Optimization of Design. Lecturer:Dung-An Wang Lecture 8 Optimization of Design Lecturer:Dung-An Wang Lecture 8 Lecture outline Reading: Ch8 of text Today s lecture 2 8.1 LINEAR FUNCTIONS Cost Function Constraints 3 8.2 The standard LP problem Only equality

More information

Matching and Planarity

Matching and Planarity Matching and Planarity Po-Shen Loh June 010 1 Warm-up 1. (Bondy 1.5.9.) There are n points in the plane such that every pair of points has distance 1. Show that there are at most n (unordered) pairs of

More information

Graphs that have the feasible bases of a given linear

Graphs that have the feasible bases of a given linear Algorithmic Operations Research Vol.1 (2006) 46 51 Simplex Adjacency Graphs in Linear Optimization Gerard Sierksma and Gert A. Tijssen University of Groningen, Faculty of Economics, P.O. Box 800, 9700

More information

Three applications of Euler s formula. Chapter 10

Three applications of Euler s formula. Chapter 10 Three applications of Euler s formula Chapter 10 A graph is planar if it can be drawn in the plane R without crossing edges (or, equivalently, on the -dimensional sphere S ). We talk of a plane graph if

More information

Combinatorics and Combinatorial Geometry by: Adrian Tang math.ucalgary.ca

Combinatorics and Combinatorial Geometry by: Adrian Tang   math.ucalgary.ca IMO Winter Camp 2009 - Combinatorics and Combinatorial Geometry 1 1. General Combinatorics Combinatorics and Combinatorial Geometry by: Adrian Tang Email: tang @ math.ucalgary.ca (Extremal Principle:)

More information

2. Functions, sets, countability and uncountability. Let A, B be sets (often, in this module, subsets of R).

2. Functions, sets, countability and uncountability. Let A, B be sets (often, in this module, subsets of R). 2. Functions, sets, countability and uncountability I. Functions Let A, B be sets (often, in this module, subsets of R). A function f : A B is some rule that assigns to each element of A a unique element

More information

Lecture 10,11: General Matching Polytope, Maximum Flow. 1 Perfect Matching and Matching Polytope on General Graphs

Lecture 10,11: General Matching Polytope, Maximum Flow. 1 Perfect Matching and Matching Polytope on General Graphs CMPUT 675: Topics in Algorithms and Combinatorial Optimization (Fall 2009) Lecture 10,11: General Matching Polytope, Maximum Flow Lecturer: Mohammad R Salavatipour Date: Oct 6 and 8, 2009 Scriber: Mohammad

More information

Unknot recognition, linear programming and the elusive polynomial time algorithm

Unknot recognition, linear programming and the elusive polynomial time algorithm Unknot recognition, linear programming and the elusive polynomial time algorithm Benjamin Burton The University of Queensland June 16, 2011 1 / 28 2 / 28 Outline 1 Decision problems in geometric topology

More information

The orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P.

The orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P. Title Author(s) The orientability of small covers and coloring simple polytopes Nishimura, Yasuzo; Nakayama, Hisashi Citation Osaka Journal of Mathematics. 42(1) P.243-P.256 Issue Date 2005-03 Text Version

More information

ACTUALLY DOING IT : an Introduction to Polyhedral Computation

ACTUALLY DOING IT : an Introduction to Polyhedral Computation ACTUALLY DOING IT : an Introduction to Polyhedral Computation Jesús A. De Loera Department of Mathematics Univ. of California, Davis http://www.math.ucdavis.edu/ deloera/ 1 What is a Convex Polytope? 2

More information

The Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids

The Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids The Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids. The Fully Optimal Basis of a Bounded Region Emeric Gioan Michel Las Vergnas published in European Journal of Combinatorics

More information

PUBLICATION LIST ( ) Jesús Antonio De Loera

PUBLICATION LIST ( ) Jesús Antonio De Loera PUBLICATION LIST (1995-2013) Jesús Antonio De Loera Books (1) (with F. Santos and J. Rambau) Triangulations: Structure for Algorithms and Applications, No. 25 of the series Algorithms and Computation in

More information

In this chapter we introduce some of the basic concepts that will be useful for the study of integer programming problems.

In this chapter we introduce some of the basic concepts that will be useful for the study of integer programming problems. 2 Basics In this chapter we introduce some of the basic concepts that will be useful for the study of integer programming problems. 2.1 Notation Let A R m n be a matrix with row index set M = {1,...,m}

More information

Lecture 14: Linear Programming II

Lecture 14: Linear Programming II A Theorist s Toolkit (CMU 18-859T, Fall 013) Lecture 14: Linear Programming II October 3, 013 Lecturer: Ryan O Donnell Scribe: Stylianos Despotakis 1 Introduction At a big conference in Wisconsin in 1948

More information