Ehrhart Polynomials of Zonotopes
|
|
- Rodney Hines
- 6 years ago
- Views:
Transcription
1 Matthias Beck San Francisco State University Katharina Jochemko Kungliga Tekniska Högskolan Emily McCullough University of San Francisco AMS Session Ehrhart Theory an its Applications Hunter College 2017
2 The purely formal language of geometry escribes aequately the reality of space. We might say, in this sense, that geometry is successful magic. I shoul like to state a converse: is not all magic, to the extent that it is successful, geometry? René Thom
3 Ehrhart Polynomials Theorem (Ehrhart 1962) For any lattice polytope P R, ehr P (t) := tp Z is a polynomial in t of egree := im P with leaing coefficient vol P an constant term 1. Ehr P (z) := 1 + t 1 ehr P (t) z t = h (z) (1 z) +1 Equivalent escriptions of an Ehrhart polynomial: ehr P (t) = c t + c 1 t c 0 via roots of ehr P (t) Ehr P (z) ehr P (t) = h 0 ( t+ ) + h 1 ( t+ 1 ) + + h ( t ) (Wie) Open Problem Classify Ehrhart polynomials. Bil!
4 Two-imensional Ehrhart Polynomials c 1 Essentially ue to Pick (1899) an Scott (1976) (iii) (ii) 1 (i) 1 c 2
5 Ehrhart Polynomials Theorem (Ehrhart 1962) For any lattice polytope P, ehr P (t) is a polynomial in t of egree := im P with leaing coefficient vol P an constant term 1. Ehr P (z) := 1 + t 1 ehr P (t) z t = h (z) (1 z) +1 ehr P (t) = h 0 ( t+ ) + h 1 ( t+ 1 ) + + h ( t ) Theorem (Maconal 1971) ( 1) ehr P ( t) enumerates the interior lattice points in tp. Equivalently, ehr P (t) = h ( t+ 1 ) + h 1 ( t+ 2 ) + + h 0 ( t 1 )
6 Ehrhart Polynomials Theorem (Ehrhart 1962) For any lattice polytope P, ehr P (t) is a polynomial in t of egree := im P with leaing coefficient vol P an constant term 1. Ehr P (z) := 1 + t 1 ehr P (t) z t = h (z) (1 z) +1 ehr P (t) = h ( t+ 1 ) + h 1 ( t+ 2 ) + + h 0 ( t 1 ) Theorem (Stanley 1980) h 0, h 1,..., h are nonnegative integers. Corollary If h +1 k > 0 then kp contains an integer point.
7 Positivity Among Ehrhart Polynomials Theorem (Ehrhart 1962) For any lattice polytope P, ehr P (t) is a polynomial in t of egree := im P with leaing coefficient vol P an constant term 1. Ehr P (z) := 1 + t 1 ehr P (t) z t = h (z) (1 z) +1 Theorem (Stanley 1980) h 0, h 1,..., h are nonnegative integers. Theorem (Betke McMullen 1985, Stapleon 2009) If h > 0 then h (z) = a(z) + z b(z) where a(z) = z a( 1 z ) an b(z) = z 1 b( 1 z ) with nonnegative coefficients.
8 Positivity Among Ehrhart Polynomials Theorem (Ehrhart 1962) For any lattice polytope P, ehr P (t) is a polynomial in t of egree := im P with leaing coefficient vol P an constant term 1. Ehr P (z) := 1 + t 1 ehr P (t) z t = h (z) (1 z) +1 Theorem (Stanley 1980) h 0, h 1,..., h are nonnegative integers. Theorem (Betke McMullen 1985, Stapleon 2009) If h > 0 then h (z) = a(z) + z b(z) where a(z) = z a( 1 z ) an b(z) = z 1 b( 1 z ) with nonnegative coefficients. Open Problem Try to prove the analogous theorem for your favorite combinatorial polynomial with nonnegative coefficients.
9 Unimoality & Real-roote Polynomials The polynomial h(z) = j=0 h jz j is unimoal if for some k {0, 1,..., } h 0 h 1 h k h Crucial Example h(z) has only real roots Open Problem Classify lattice polytopes with unimoal/real-roote h (z)
10 Unimoality & Real-roote Polynomials The polynomial h(z) = j=0 h jz j is unimoal if for some k {0, 1,..., } h 0 h 1 h k h Crucial Example h(z) has only real roots Open Problem Classify lattice polytopes with unimoal/real-roote h (z) Conjecture (Stanley 1989) h (z) is unimoal for integrally close polytopes. Classic Example P = [0, 1] comes with the Eulerian polynomial h (z) Theorem (Schepers Van Langenhoven 2013) h (z) is unimoal for lattice parallelepipes.
11 Zonotopes The zonotope generate by v 1,..., v n R is { n j=1 } λ j v j : 0 λ j 1 Theorem (MB Jochemko McCullough) zonotopes. h (z) is real roote for lattice
12 Zonotopes The zonotope generate by v 1,..., v n R is { n j=1 } λ j v j : 0 λ j 1 Theorem (MB Jochemko McCullough) zonotopes. h (z) is real roote for lattice Theorem (MB Jochemko McCullough) The convex hull of the h -polynomials of all -imensional lattice zonotopes is the -imensional simplicial cone A 1 ( + 1, z) + R 0 A 2 ( + 1, z) + + R 0 A +1 ( + 1, z) where we efine an (A, j)-eulerian polynomial as A j (, z) := 1 k=0 {σ S : σ() = + 1 j an es(σ) = k} z k
13 Eulerian Polynomials The (type A) Eulerian polynomials are A(, z) := 1 k=0 {σ S : es(σ) = k} z k where es(σ) is the number of escents σ(j + 1) < σ(j) A(, z) is symmetric, real roote, an t 0 (t + 1) z t = A(, z) (1 z) +1
14 Eulerian Polynomials The (type A) Eulerian polynomials are A(, z) := 1 k=0 {σ S : es(σ) = k} z k where es(σ) is the number of escents σ(j + 1) < σ(j) A(, z) is symmetric, real roote, an t 0 (t + 1) z t = A(, z) (1 z) +1 My favorite proof Compute the Ehrhart series of [0, 1] = σ S { x R : 0 x σ() x σ( 1) x σ(1) 1 x σ(j+1) < x σ(j) if j Des(σ) }
15 Eulerian Polynomials The (type A) Eulerian polynomials are A(, z) := 1 k=0 {σ S : es(σ) = k} z k where es(σ) is the number of escents σ(j + 1) < σ(j) A(, z) is symmetric, real roote, an t 0 (t + 1) z t = A(, z) (1 z) +1 A j (, z) := 1 k=0 {σ S : σ() = + 1 j an es(σ) = k} z k seem to have first been use by Brenti Welker (2008). They are not all symmetric but unimoal (Kubitzke Nevo 2009) an real roote (Savage Visontai 2015).
16 The Geometry of Refine Eulerian Polynomials Lemma 1 A j (, z) = 1 k=0 is the h -polynomial of the half-open cube {σ S : σ() = + 1 j an es(σ) = k} z k C j := [0, 1] \ { x R : x = x 1 = = x +1 j = 1 } Lemma 2 The h -polynomial of a half-open lattice parallelepipe is a linear combination of A j (, z). Lemma 3 p
17 Zonotopal h -polynomials Theorem (MB Jochemko McCullough) zonotopes. h (z) is real roote for lattice Theorem (MB Jochemko McCullough) The convex hull of the h -polynomials of all -imensional lattice zonotopes is the -imensional simplicial cone K := A 1 ( + 1, z) + R 0 A 2 ( + 1, z) + + R 0 A +1 ( + 1, z) Open Problem Classify h -polynomials of -imensional lattice zonotopes. This is nontrivial: we can prove that each h -polynomial is actually in A 1 ( + 1, z) + Z 0 A 2 ( + 1, z) + + Z 0 A +1 ( + 1, z) however, K is not integrally close. (An the above is not complete either.)
18 Valuations A Z -valuation ϕ satisfies ϕ( ) = 0, ϕ(p Q) = ϕ(p) + ϕ(q) ϕ(p Q) whenever P, Q, P Q, P Q are lattice polytopes, an ϕ(p + x) = ϕ(p) for all x Z. Theorem (McMullen 1977) For any lattice polytope P ϕ(tp) z t t 0 = hϕ 0 + hϕ 1 z + + hϕ (P ) z (1 z) +1
19 Valuations A Z -valuation ϕ satisfies ϕ( ) = 0, ϕ(p Q) = ϕ(p) + ϕ(q) ϕ(p Q) whenever P, Q, P Q, P Q are lattice polytopes, an ϕ(p + x) = ϕ(p) for all x Z. Theorem (McMullen 1977) For any lattice polytope P ϕ(tp) z t t 0 = hϕ 0 + hϕ 1 z + + hϕ z (1 z) +1 Theorem (Jochemko Sanyal 2016) A Z -valuation ϕ satisfies h ϕ 0 for every lattice polytope if an only if ϕ( ) 0 for all lattice simplices. Theorem (MB Jochemko McCullough) h ϕ (z) is real roote for any lattice zonotope an any combinatorially positive valuation ϕ.
20 Matroi Connections Conjecture (Schepers Van Langenhoven 2013) An integrally close polytope with interior lattice points has an alternatingly increasing h -polynomial. Theorem (MB Jochemko McCullough) The Schepers Van Langenhoven Conjecture hols for coloop-free zonotopes (generate by v 1,..., v n none of which is containe in every maximally linearly inepenent subset). Main Iea The h -polynomial of a zonotope generate by the columns of a totally unimoular matrix can be expresse as a linear combination of A j (, z). This extens Stanley s 1980 theorem that for Z generate by V Z ehr Z (n) = g(i) n I where I ranges over all linearly inepenent subsets of V an g(i) enotes the greatest common ivisor of all maximal minors of the matrix with column vectors I. I
21 Type B Conjecture (Schepers Van Langenhoven 2013) An integrally close polytope with interior lattice points has an alternatingly increasing h -polynomial. Theorem (MB Jochemko McCullough) Conjecture hols for type-b zonotopes The Schepers Van Langenhoven } j=1 λ jv j : 1 λ j 1 { n Main tool Type-B Eulerian polynomials stemming from signe permutations (2t + 1) z t = t 0 Theorem (Brenti 1994) B(, z) is real roote. B(, z) (1 z) +1
22 Type B Conjecture (Schepers Van Langenhoven 2013) An integrally close polytope with interior lattice points has an alternatingly increasing h -polynomial. Theorem (MB Jochemko McCullough) Conjecture hols for type-b zonotopes The Schepers Van Langenhoven } j=1 λ jv j : 1 λ j 1 { n Main tool We efine the (B, l)-eulerian polynomials B l (, z) := {(σ, ɛ) B : ɛ σ() = + 1 l an es(σ, ɛ) = k} z k, k=0 prove that they are real roote an alternatingly increasing, an realize them as h -polynomials of half-open ±1-cubes.
Real-rooted h -polynomials
Real-rooted h -polynomials Katharina Jochemko TU Wien Einstein Workshop on Lattice Polytopes, December 15, 2016 Unimodality and real-rootedness Let a 0,..., a d 0 be real numbers. Unimodality a 0 a i a
More informationh -polynomials of dilated lattice polytopes
h -polynomials of dilated lattice polytopes Katharina Jochemko KTH Stockholm Einstein Workshop Discrete Geometry and Topology, March 13, 2018 Lattice polytopes A set P R d is a lattice polytope if there
More information10 Years BADGeometry: Progress and Open Problems in Ehrhart Theory
10 Years BADGeometry: Progress and Open Problems in Ehrhart Theory Matthias Beck (San Francisco State University) math.sfsu.edu/beck Thanks To... 10 Years BADGeometry: Progress and Open Problems in Ehrhart
More informationCombinatorial Reciprocity Theorems
Combinatorial Reciprocity Theorems Matthias Beck San Francisco State University math.sfsu.edu/beck based on joint work with Raman Sanyal Universität Frankfurt JCCA 2018 Sendai Thomas Zaslavsky Binghamton
More informationand Other Combinatorial Reciprocity Instances
and Other Combinatorial Reciprocity Instances Matthias Beck San Francisco State University math.sfsu.edu/beck [Courtney Gibbons] Act 1: Binomial Coefficients Not everything that can be counted counts,
More informationCombinatorial Reciprocity Theorems
Combinatorial Reciprocity Theorems Matthias Beck San Francisco State University math.sfsu.edu/beck Based on joint work with Thomas Zaslavsky Binghamton University (SUNY) In mathematics you don t understand
More informationCounting Lattice Points in Polytopes: The Ehrhart Theory
3 Counting Lattice Points in Polytopes: The Ehrhart Theory Ubi materia, ibi geometria. Johannes Kepler (1571 1630) Given the profusion of examples that gave rise to the polynomial behavior of the integer-point
More informationMAXIMAL PERIODS OF (EHRHART) QUASI-POLYNOMIALS
MAXIMAL PERIODS OF (EHRHART QUASI-POLYNOMIALS MATTHIAS BECK, STEVEN V. SAM, AND KEVIN M. WOODS Abstract. A quasi-polynomial is a function defined of the form q(k = c d (k k d + c d 1 (k k d 1 + + c 0(k,
More informationA Finite Calculus Approach to Ehrhart Polynomials. Kevin Woods, Oberlin College (joint work with Steven Sam, MIT)
A Finite Calculus Approach to Ehrhart Polynomials Kevin Woods, Oberlin College (joint work with Steven Sam, MIT) Ehrhart Theory Let P R d be a rational polytope L P (t) = #tp Z d Ehrhart s Theorem: L p
More informationEnumerating integer points in polytopes: applications to number theory. Matthias Beck San Francisco State University math.sfsu.
Enumerating integer points in polytopes: applications to number theory Matthias Beck San Francisco State University math.sfsu.edu/beck It takes a village to count integer points. Alexander Barvinok Outline
More informationMARTIN HENK AND MAKOTO TAGAMI
LOWER BOUNDS ON THE COEFFICIENTS OF EHRHART POLYNOMIALS MARTIN HENK AND MAKOTO TAGAMI Abstract. We present lower bouns for the coefficients of Ehrhart polynomials of convex lattice polytopes in terms of
More informationLattice polygons. P : lattice polygon in R 2 (vertices Z 2, no self-intersections)
Lattice polygons P : lattice polygon in R 2 (vertices Z 2, no self-intersections) A, I, B A = area of P I = # interior points of P (= 4) B = #boundary points of P (= 10) Pick s theorem Georg Alexander
More informationComputing the continuous discretely: The magic quest for a volume
Computing the continuous discretely: The magic quest for a volume Matthias Beck San Francisco State University math.sfsu.edu/beck Joint work with... Dennis Pixton (Birkhoff volume) Ricardo Diaz and Sinai
More informationTHE LECTURE HALL PARALLELEPIPED
THE LECTURE HALL PARALLELEPIPED FU LIU AND RICHARD P. STANLEY Abstract. The s-lecture hall polytopes P s are a class of integer polytopes defined by Savage and Schuster which are closely related to the
More informationEhrhart Positivity. Federico Castillo. December 15, University of California, Davis. Joint work with Fu Liu. Ehrhart Positivity
University of California, Davis Joint work with Fu Liu December 15, 2016 Lattice points of a polytope A (convex) polytope is a bounded solution set of a finite system of linear inequalities, or is the
More informationThe Arithmetic of Graph Polynomials. Maryam Farahmand. A dissertation submitted in partial satisfaction of the. requirements for the degree of
The Arithmetic of Graph Polynomials by Maryam Farahmand A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Mathematics in the Graduate Division
More informationThe degree of lattice polytopes
The degree of lattice polytopes Benjamin Nill - FU Berlin Graduiertenkolleg MDS - December 10, 2007 Lattice polytopes having h -polynomials with given degree and linear coefficient. arxiv:0705.1082, to
More informationarxiv: v2 [math.co] 16 Aug 2018
A BRIEF SURVEY ON LATTICE ZONOTOPES arxiv:1808.04933v2 [math.co] 16 Aug 2018 BENJAMIN BRAUN AND ANDRÉS R. VINDAS-MELÉNDEZ Abstract. Zonotopes are a rich and fascinating family of polytopes, with connections
More informationThe partial-fractions method for counting solutions to integral linear systems
The partial-fractions method for counting solutions to integral linear systems Matthias Beck, MSRI www.msri.org/people/members/matthias/ arxiv: math.co/0309332 Vector partition functions A an (m d)-integral
More informationLower Bounds for the Smoothed Number of Pareto optimal Solutions
Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.
More informationDiscrete Mathematics
Discrete Mathematics 309 (009) 86 869 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/isc Profile vectors in the lattice of subspaces Dániel Gerbner
More informationTORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS
TORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS YUSUKE SUYAMA Abstract. We give a necessary and sufficient condition for the nonsingular projective toric variety associated to a building set to be
More informationThe Hodge theory of degenerating hypersurfaces
The Hodge theory of degenerating hypersurfaces Eric Katz (University of Waterloo) joint with Alan Stapledon (University of Sydney) October 20, 2013 Eric Katz (Waterloo) Hodge theory of degenerating hypersurfaces
More informationThe degree of lattice polytopes
The degree of lattice polytopes Benjamin Nill - FU Berlin Stanford University, October 10, 2007 1. The h -polynomial Throughout: M = Z r is a lattice, M R := M Z R = R r. P M R is n-dimensional lattice
More informationarxiv: v2 [math.co] 23 Feb 2008
INEQUALITIES AND EHRHART δ-vectors arxiv:0801.0873v2 [math.co] 23 Feb 2008 A. STAPLEDON Abstract. For any lattice polytope P, we consider an associated polynomial δ P (t) and describe its decomposition
More informationA thesis presented to the faculty of San Francisco State University In partial fulfilment of The Requirements for The Degree
ON THE POLYHEDRAL GEOMETRY OF t DESIGNS A thesis presented to the faculty of San Francisco State University In partial fulfilment of The Requirements for The Degree Master of Arts In Mathematics by Steven
More informationarxiv: v3 [math.co] 1 Oct 2018
NON-SPANNING LATTICE 3-POLYTOPES arxiv:7.07603v3 [math.co] Oct 208 Abstract. We completely classify non-spanning 3-polytopes, by which we mean lattice 3-polytopes whose lattice points do not affinely span
More informationarxiv: v2 [math.co] 2 Dec 2015
SCHEDULING PROBLEMS FELIX BREUER AND CAROLINE J. KLIVANS arxiv:1401.2978v2 [math.co] 2 Dec 2015 Abstract. We introduce the notion of a scheduling problem which is a boolean function S over atomic formulas
More informationCAYLEY COMPOSITIONS, PARTITIONS, POLYTOPES, AND GEOMETRIC BIJECTIONS
CAYLEY COMPOSITIONS, PARTITIONS, POLYTOPES, AND GEOMETRIC BIJECTIONS MATJAŽ KONVALINKA AND IGOR PAK Abstract. In 1857, Cayley showed that certain sequences, now called Cayley compositions, are equinumerous
More informationThe Triangle Closure is a Polyhedron
The Triangle Closure is a Polyhedron Amitabh Basu Robert Hildebrand Matthias Köppe November 7, 21 Abstract Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively
More informationClassification of Ehrhart polynomials of integral simplices
FPSAC 2012, Nagoya, Japan DMTCS proc. AR, 2012, 591 598 Classification of Ehrhart polynomials of integral simplices Akihiro Higashitani Department of Pure and Applied Mathematics, Graduate School of Information
More informationFrom the Zonotope Construction to the Minkowski Addition of Convex Polytopes
From the Zonotope Construction to the Minkowski Addition of Convex Polytopes Komei Fukuda School of Computer Science, McGill University, Montreal, Canada Abstract A zonotope is the Minkowski addition of
More informationThe Triangle Closure is a Polyhedron
The Triangle Closure is a Polyhedron Amitabh Basu Robert Hildebrand Matthias Köppe January 8, 23 Abstract Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively
More informationON THE INTEGRAL RING SPANNED BY GENUS TWO WEIGHT ENUMERATORS. Manabu Oura
ON THE INTEGRAL RING SPANNED BY GENUS TWO WEIGHT ENUMERATORS Manabu Oura Abstract. It is known that the weight enumerator of a self-ual oublyeven coe in genus g = 1 can be uniquely written as an isobaric
More informationEhrhart polynomial for lattice squares, cubes, and hypercubes
Ehrhart polynomial for lattice squares, cubes, and hypercubes Eugen J. Ionascu UWG, REU, July 10th, 2015 math@ejionascu.ro, www.ejionascu.ro 1 Abstract We are investigating the problem of constructing
More informationWitt#5: Around the integrality criterion 9.93 [version 1.1 (21 April 2013), not completed, not proofread]
Witt vectors. Part 1 Michiel Hazewinkel Sienotes by Darij Grinberg Witt#5: Aroun the integrality criterion 9.93 [version 1.1 21 April 2013, not complete, not proofrea In [1, section 9.93, Hazewinkel states
More informationSELECTIVELY BALANCING UNIT VECTORS AART BLOKHUIS AND HAO CHEN
SELECTIVELY BALANCING UNIT VECTORS AART BLOKHUIS AND HAO CHEN Abstract. A set U of unit vectors is selectively balancing if one can find two disjoint subsets U + and U, not both empty, such that the Euclidean
More informationDissimilarity Vectors of Trees and Their Tropical Linear Spaces
Dissimilarity Vectors of Trees and Their Tropical Linear Spaces Benjamin Iriarte Giraldo Massachusetts Institute of Technology FPSAC 0, Reykjavik, Iceland Basic Notions A weighted n-tree T : A trivalent
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology 18.433: Combinatorial Optimization Michel X. Goemans February 28th, 2013 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory
More informationLECTURE NOTES ON DVORETZKY S THEOREM
LECTURE NOTES ON DVORETZKY S THEOREM STEVEN HEILMAN Abstract. We present the first half of the paper [S]. In particular, the results below, unless otherwise state, shoul be attribute to G. Schechtman.
More informationAsymptotic determination of edge-bandwidth of multidimensional grids and Hamming graphs
Asymptotic etermination of ege-banwith of multiimensional gris an Hamming graphs Reza Akhtar Tao Jiang Zevi Miller. Revise on May 7, 007 Abstract The ege-banwith B (G) of a graph G is the banwith of the
More informationBehaviour of Lipschitz functions on negligible sets. Non-differentiability in R. Outline
Behaviour of Lipschitz functions on negligible sets G. Alberti 1 M. Csörnyei 2 D. Preiss 3 1 Università di Pisa 2 University College London 3 University of Warwick Lars Ahlfors Centennial Celebration Helsinki,
More informationA Geometric Approach to Graph Isomorphism
A Geometric Approach to Graph Isomorphism Pawan Aurora and Shashank K Mehta Indian Institute of Technology, Kanpur - 208016, India {paurora,skmehta}@cse.iitk.ac.in Abstract. We present an integer linear
More informationHodge theory for combinatorial geometries
Hodge theory for combinatorial geometries June Huh with Karim Adiprasito and Eric Katz June Huh 1 / 48 Three fundamental ideas: June Huh 2 / 48 Three fundamental ideas: The idea of Bernd Sturmfels that
More informationAn Introduction to Transversal Matroids
An Introduction to Transversal Matroids Joseph E Bonin The George Washington University These slides and an accompanying expository paper (in essence, notes for this talk, and more) are available at http://homegwuedu/
More informationToric Varieties and the Secondary Fan
Toric Varieties and the Secondary Fan Emily Clader Fall 2011 1 Motivation The Batyrev mirror symmetry construction for Calabi-Yau hypersurfaces goes roughly as follows: Start with an n-dimensional reflexive
More informationInteger points enumerator of hypergraphic polytopes
arxiv:1812.09770v1 [math.co] 23 Dec 2018 Integer points enumerator of hypergraphic polytopes Marko Pešović Faculty of Civil Engineering, University of Belgrade mpesovic@grf.bg.ac.rs Mathematics Subject
More informationPermanent vs. Determinant
Permanent vs. Determinant Frank Ban Introuction A major problem in theoretical computer science is the Permanent vs. Determinant problem. It asks: given an n by n matrix of ineterminates A = (a i,j ) an
More information2 Thus, to determine the f-vector of P, we only need to know approximately half of its entries. This raises the question: Which ( d+1
Mathematical Association of America Golden Section (Northern California, Nevada and Hawaii) Saturday, February 27, 2016 University of California, Davis STUDENT POSTER SESSION ABSTRACTS Title. Dehn Sommerville
More informationFlows on Simplicial Complexes
FPSAC 2012, Nagoya, Japan DMTCS proc. AR, 2012, 827 836 Flows on Simplicial Complexes Matthias Beck 1 and Yvonne Kemper 2 1 Department of Mathematics, San Francisco State University, San Francisco, CA
More informationThe Eulerian polynomials of type D have only real roots
FPSAC 2013, Paris, France DMTCS proc. (subm.), by the authors, 1 12 The Eulerian polynomials of type D have only real roots Carla D. Savage 1 and Mirkó Visontai 2 1 Department of Computer Science, North
More informationGeneralized Ehrhart polynomials
FPSAC 2010, San Francisco, USA DMTCS proc. (subm.), by the authors, 1 8 Generalized Ehrhart polynomials Sheng Chen 1 and Nan Li 2 and Steven V Sam 2 1 Department of Mathematics, Harbin Institute of Technology,
More informationNEERAJ KUMAR AND K. SENTHIL KUMAR. 1. Introduction. Theorem 1 motivate us to ask the following:
NOTE ON VANISHING POWER SUMS OF ROOTS OF UNITY NEERAJ KUMAR AND K. SENTHIL KUMAR Abstract. For xe positive integers m an l, we give a complete list of integers n for which their exist mth complex roots
More informationOn the minimum distance of elliptic curve codes
On the minimum istance of elliptic curve coes Jiyou Li Department of Mathematics Shanghai Jiao Tong University Shanghai PRChina Email: lijiyou@sjtueucn Daqing Wan Department of Mathematics University of
More informationNormal lattice polytopes
FB Mathematik/Informatik Universität Osnabrück wbruns@uos.de Osnabrück, July 2015 Joint work with Joseph Gubeladze (San Francisco, since 1995) and Mateusz Micha lek (Berlin/Berkeley, more recently) Lattice
More informationHamiltonian Tournaments and Gorenstein Rings
Europ. J. Combinatorics (2002) 23, 463 470 doi:10.1006/eujc.2002.0572 Available online at http://www.idealibrary.com on Hamiltonian Tournaments and Gorenstein Rings HIDEFUMI OHSUGI AND TAKAYUKI HIBI Let
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans April 5, 2017 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory
More informationPositroids, non-crossing partitions, and a conjecture of da Silva
Positroids, non-crossing partitions, and a conjecture of da Silva Federico Ardila M. San Francisco State University, San Francisco, California. Universidad de Los Andes, Bogotá, Colombia. Discrete Models
More informationA MINIMAL-DISTANCE CHROMATIC POLYNOMIAL FOR SIGNED GRAPHS
A MINIMAL-DISTANCE CHROMATIC POLYNOMIAL FOR SIGNED GRAPHS A thesis presented to the faculty of San Francisco State University In partial fulfilment of The Requirements for The Degree Master of Arts In
More informationCOUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF
COUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF NATHAN KAPLAN Abstract. The genus of a numerical semigroup is the size of its complement. In this paper we will prove some results
More informationmatroid polytopes and their volumes.
matroid polytopes and their volumes. federico ardila carolina benedetti jeffrey doker abstract. We express the matroid polytope P M of a matroid M as a signed Minkowski sum of simplices, and obtain a formula
More informationGorenstein rings through face rings of manifolds.
Gorenstein rings through face rings of manifolds. Isabella Novik Department of Mathematics, Box 354350 University of Washington, Seattle, WA 98195-4350, USA, novik@math.washington.edu Ed Swartz Department
More informationZeros of Generalized Eulerian Polynomials
Zeros of Generalized Eulerian Polynomials Carla D. Savage 1 Mirkó Visontai 2 1 Department of Computer Science North Carolina State University 2 Google Inc (work done while at UPenn & KTH). Geometric and
More informationA Geometric Approach to Carlitz-Dedekind Sums
A Geometric Approach to Carlitz-Dedekind Sums A thesis presented to the faculty of San Francisco State University In partial fulfilment of The requirements for The degree Master of Arts In Mathematics
More informationTop Ehrhart coefficients of integer partition problems
Top Ehrhart coefficients of integer partition problems Jesús A. De Loera Department of Mathematics University of California, Davis Joint Math Meetings San Diego January 2013 Goal: Count the solutions
More informationA Characterization of (3+1)-Free Posets
Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of
More informationarxiv: v1 [math.co] 19 Apr 2017
PROOF OF CHAPOTON S CONJECTURE ON NEWTON POLYTOPES OF q-ehrhart POLYNOMIALS arxiv:1704.0561v1 [ath.co] 19 Apr 017 JANG SOO KIM AND U-KEUN SONG Abstract. Recently, Chapoton found a q-analog of Ehrhart polynoials,
More informationCOEFFICIENTS AND ROOTS OF EHRHART POLYNOMIALS
COEFFICIENTS AND ROOTS OF EHRHART POLYNOMIALS M. BECK, J. A. DE LOERA, M. DEVELIN, J. PFEIFLE, AND R. P. STANLEY Abstract. The Ehrhart polynomial of a convex lattice polytope counts integer points in integral
More informationSolving the MWT. Recall the ILP for the MWT. We can obtain a solution to the MWT problem by solving the following ILP:
Solving the MWT Recall the ILP for the MWT. We can obtain a solution to the MWT problem by solving the following ILP: max subject to e i E ω i x i e i C E x i {0, 1} x i C E 1 for all critical mixed cycles
More informationWeek 1: Number Theory - Euler Phi Function, Order and Primitive Roots. 1 Greatest Common Divisor and the Euler Phi Function
2010 IMO Summer Training: Number Theory 1 Week 1: Number Theory - Euler Phi Function, Orer an Primitive Roots 1 Greatest Common Divisor an the Euler Phi Function Consier the following problem. Exercise
More informationChapter 1. Preliminaries
Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between
More informationarxiv: v1 [math.co] 30 Nov 2014
DISCRETE EQUIDECOMPOSABILITY AND EHRHART THEORY OF POLYGONS PAXTON TURNER AND YUHUAI (TONY) WU arxiv:1412.0196v1 [math.co] 30 Nov 2014 Abstract. Motivated by questions from Ehrhart theory, we present new
More informationTOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH
English NUMERICAL MATHEMATICS Vol14, No1 Series A Journal of Chinese Universities Feb 2005 TOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH He Ming( Λ) Michael K Ng(Ξ ) Abstract We
More informationENUMERATING COLORINGS, TENSIONS AND FLOWS IN CELL COMPLEXES
ENUMERATING COLORINGS, TENSIONS AND FLOWS IN CELL COMPLEXES MATTHIAS BECK, FELIX BREUER, LOGAN GODKIN, AND JEREMY L. MARTIN Abstract. We study quasipolynomials enumerating proper colorings, nowherezero
More informationBIVARIATE ORDER POLYNOMIALS. Sandra Zuniga Ruiz
BIVARIATE ORDER POLYNOMIALS Sandra Zuniga Ruiz Contents 1 Introduction 3 2 Background 4 2.1 Graph Theory................................... 4 2.1.1 Basic Properties.............................. 4 2.1.2
More informationTORIC REDUCTION AND TROPICAL GEOMETRY A.
Mathematisches Institut, Seminars, (Y. Tschinkel, ed.), p. 109 115 Universität Göttingen, 2004-05 TORIC REDUCTION AND TROPICAL GEOMETRY A. Szenes ME Institute of Mathematics, Geometry Department, Egry
More informationTRISTRAM BOGART AND REKHA R. THOMAS
SMALL CHVÁTAL RANK TRISTRAM BOGART AND REKHA R. THOMAS Abstract. We introduce a new measure of complexity of integer hulls of rational polyhedra called the small Chvátal rank (SCR). The SCR of an integer
More informationRotation by 90 degree counterclockwise
0.1. Injective an suejective linear map. Given a linear map T : V W of linear spaces. It is natrual to ask: Problem 0.1. Is that possible to fin an inverse linear map T 1 : W V? We briefly review those
More informationSUCCESSIVE-MINIMA-TYPE INEQUALITIES. U. Betke, M. Henk and J.M. Wills
SUCCESSIVE-MINIMA-TYPE INEQUALITIES U. Betke, M. Henk and J.M. Wills Abstract. We show analogues of Minkowski s theorem on successive minima, where the volume is replaced by the lattice point enumerator.
More informationShellability of Interval Orders
Shellability of Interval Orders Louis J. Billera and Amy N. Myers September 15, 2006 Abstract An finite interval order is a partially ordered set whose elements are in correspondence with a finite set
More informationRoot system chip-firing
Root system chip-firing PhD Thesis Defense Sam Hopkins Massachusetts Institute of Technology April 27th, 2018 Includes joint work with Pavel Galashin, Thomas McConville, Alexander Postnikov, and James
More informationh-vectors OF SMALL MATROID COMPLEXES
h-vectors OF SMALL MATROID COMPLEXES JESÚS A. DE LOERA, YVONNE KEMPER, STEVEN KLEE Abstract. Stanley conjectured in 1977 that the h-vector of a matroid simplicial complex is a pure O-sequence. We give
More informationSurprising Examples of Manifolds in Toric Topology!
Surprising Examples of Manifolds in Toric Topology! Djordje Baralić Mathematical Institute SASA Belgrade Serbia Lazar Milenković Union University Faculty of Computer Science Belgrade Serbia arxiv:17005932v1
More informationASPHERIC ORIENTATIONS OF SIMPLICIAL COMPLEXES
ASPHERIC ORIENTATIONS OF SIMPLICIAL COMPLEXES A thesis presented to the faculty of San Francisco State University In partial fulfillment of The requirements for The degree Master of Arts In Mathematics
More informationAuerbach bases and minimal volume sufficient enlargements
Auerbach bases and minimal volume sufficient enlargements M. I. Ostrovskii January, 2009 Abstract. Let B Y denote the unit ball of a normed linear space Y. A symmetric, bounded, closed, convex set A in
More informationON THE RANK OF A TROPICAL MATRIX
ON THE RANK OF A TROPICAL MATRIX MIKE DEVELIN, FRANCISCO SANTOS, AND BERND STURMFELS Abstract. This is a foundational paper in tropical linear algebra, which is linear algebra over the min-plus semiring.
More informationEquality of P-partition Generating Functions
Bucknell University Bucknell Digital Commons Honors Theses Student Theses 2011 Equality of P-partition Generating Functions Ryan Ward Bucknell University Follow this and additional works at: https://digitalcommons.bucknell.edu/honors_theses
More informationLecture 6 - Convex Sets
Lecture 6 - Convex Sets Definition A set C R n is called convex if for any x, y C and λ [0, 1], the point λx + (1 λ)y belongs to C. The above definition is equivalent to saying that for any x, y C, the
More informationLecture 1. Toric Varieties: Basics
Lecture 1. Toric Varieties: Basics Taras Panov Lomonosov Moscow State University Summer School Current Developments in Geometry Novosibirsk, 27 August1 September 2018 Taras Panov (Moscow University) Lecture
More informationarxiv: v1 [math.co] 28 Mar 2016
The unimodality of the Ehrhart δ-polynomial of the chain polytope of the zig-zag poset Herman Z.Q. Chen 1 and Philip B. Zhang 2 arxiv:1603.08283v1 [math.co] 28 Mar 2016 1 Center for Combinatorics, LPMC
More informationLecture 22. Lecturer: Michel X. Goemans Scribe: Alantha Newman (2004), Ankur Moitra (2009)
8.438 Avance Combinatorial Optimization Lecture Lecturer: Michel X. Goemans Scribe: Alantha Newman (004), Ankur Moitra (009) MultiFlows an Disjoint Paths Here we will survey a number of variants of isjoint
More informationA Sketch of Menshikov s Theorem
A Sketch of Menshikov s Theorem Thomas Bao March 14, 2010 Abstract Let Λ be an infinite, locally finite oriente multi-graph with C Λ finite an strongly connecte, an let p
More informationSupport weight enumerators and coset weight distributions of isodual codes
Support weight enumerators and coset weight distributions of isodual codes Olgica Milenkovic Department of Electrical and Computer Engineering University of Colorado, Boulder March 31, 2003 Abstract In
More informationOn the Homological Dimension of Lattices
On the Homological Dimension of Lattices Roy Meshulam August, 008 Abstract Let L be a finite lattice and let L = L {ˆ0, ˆ1}. It is shown that if the order complex L satisfies H k L 0 then L k. Equality
More informationReciprocal domains and Cohen Macaulay d-complexes in R d
Reciprocal domains and Cohen Macaulay d-complexes in R d Ezra Miller and Victor Reiner School of Mathematics, University of Minnesota, Minneapolis, MN 55455, USA ezra@math.umn.edu, reiner@math.umn.edu
More informationMAT-INF4110/MAT-INF9110 Mathematical optimization
MAT-INF4110/MAT-INF9110 Mathematical optimization Geir Dahl August 20, 2013 Convexity Part IV Chapter 4 Representation of convex sets different representations of convex sets, boundary polyhedra and polytopes:
More informationHigher Spin Alternating Sign Matrices
Higher Spin Alternating Sign Matrices Roger E. Behrend and Vincent A. Knight School of Mathematics, Cardiff University, Cardiff, CF24 4AG, UK behrendr@cardiff.ac.uk, knightva@cardiff.ac.uk Submitted: Aug
More informationFREE RESOLUTION OF POWERS OF MONOMIAL IDEALS AND GOLOD RINGS
FREE RESOLUTION OF POWERS OF MONOMIAL IDEALS AND GOLOD RINGS N. ALTAFI, N. NEMATI, S. A. SEYED FAKHARI, AND S. YASSEMI Abstract. Let S = K[x 1,..., x n ] be the polynomial ring over a field K. In this
More informationA BIJECTION BETWEEN WELL-LABELLED POSITIVE PATHS AND MATCHINGS
Séminaire Lotharingien de Combinatoire 63 (0), Article B63e A BJECTON BETWEEN WELL-LABELLED POSTVE PATHS AND MATCHNGS OLVER BERNARD, BERTRAND DUPLANTER, AND PHLPPE NADEAU Abstract. A well-labelled positive
More information