A Finite Calculus Approach to Ehrhart Polynomials. Kevin Woods, Oberlin College (joint work with Steven Sam, MIT)
|
|
- Dorcas Cole
- 6 years ago
- Views:
Transcription
1 A Finite Calculus Approach to Ehrhart Polynomials Kevin Woods, Oberlin College (joint work with Steven Sam, MIT)
2 Ehrhart Theory Let P R d be a rational polytope L P (t) = #tp Z d Ehrhart s Theorem: L p (t) = c d (t)t d + c d 1 (t)t d c 0 (t), where c i (t) are periodic. When P is integral, period = 1, so L p (t) is a polynomial.
3 An Analogy L P (t) is the discrete analog of volume 1 = L P (t). a tp Z d 1 dx = vol(tp) = vol(p)t d. tp. L P (t) vol(p)t d
4 Push the Analogy Let d be the convex hull of the origin the standard basis vectors e i. Compute the volume of t d
5 Push the Analogy Let d be the convex hull of the origin the standard basis vectors e i. Compute the volume of t d vol(t d ) = Inductively, t 0 vol(s d 1 ) ds vol(t d ) = td d!.
6 Push the Analogy Why it works so nice: t 0 t 0 is a linear operator. acts nicely on a basis of R[x]. t 0 s n = 1 n + 1 tn+1.
7 Push the Analogy Discrete version: L d (t) = Inductively, t L d 1 (s). L d (t) = (t + 1)(t + 2) (t + d). d!
8 Push the Analogy Why it works so nice: t is a linear operator. t acts nicely on a basis of R[x]. t s n = 1 n + 1 (t + 1)n+1, where t n = t(t 1)(t 2) (t d + 1).
9 Is it always this easy?
10 Is it always this easy? No.
11 A Harder One L P (t) =?
12 A Harder One L P (t) =?
13 A Harder One L Q (s) = s + 2 s s + 2 = 2 2 2
14 A Harder One s L Q (s) = + 2 s s + 2 = t L P (t) = L Q (s) 2t s + 2 = 2 2 = a polynomial!!??!!
15 A Harder One 2t s + 2 L P (t) = 2 2 t ( ) (2r 1) + 2 2r + 2 = = 1 + r=1 t 4r r=1 = 4r 2 + 4r + 1
16 A Harder One 2t s + 2 L P (t) = 2 2 t ( ) (2r 1) + 2 2r + 2 = = 1 + r=1 t 4r r=1 = 4r 2 + 4r + 1
17 A Harder One 2t s + 2 L P (t) = 2 2 t ( ) (2r 1) + 2 2r + 2 = = 1 + r=1 t 4r r=1 = 4r 2 + 4r + 1
18 Is it always this easy?
19 Is it always this easy? Yes.
20 Tools Quasi-polynomial version of finite calculus: If f (s) is a quasi-polynomial with period r, then at b F (t) = f (s) is a quasi-polynomial with period rb gcd(a, r). Key: It s the smallest t such that at b is integer multiple of r.
21 Tools Triangulation. Summation only works for pyramids. Induction. Need quasi-polynomial version even to get polynomial version. Bug? Feature?
22 Periodicity! For Free! Careful triangulation/induction immediately gives us: Theorem (McMullen) Given Ehrhart quasi-polynomial L P (t) = c 0 (t) + c 1 (t)t + + c d (t)t d, and given r and i such that the affine hull of rf contains integer points, for all i-dimensional faces F. Then r is a period of c i (t).
23 Periodicity! For Free! Let D be smallest positive integer such that DP is integral. Then D is a period of each c i (t). If P is integral, D = 1 and L P (t) is a polynomial. If P is full-dimensional: Affine hull of 1 P contains integer points. Period of c d (t) is 1. (c d (t) = vol(p))
24 Reciprocity! For Free! Theorem (Ehrhart-Macdonald Reciprocity) If P is the relative interior of P and L P (t) = #tp Z d, L P (t) = ( 1) dim(p) L P ( t).
25 Reciprocity! For Free! Reciprocity in Finite Calculus If f (t) a (quasi-)polynomial, is a (quasi-)polynomial, F (n). n f (s) n f (s)
26 Reciprocity! For Free! Reciprocity in Finite Calculus If f (t) a (quasi-)polynomial, is a (quasi-)polynomial, F (n). n f (s) n f (s) = 1 s= n+1 f (s)
27 Reciprocity! For Free! Reciprocity in Finite Calculus If f (t) a (quasi-)polynomial, is a (quasi-)polynomial, F (n). n f (s) n f (s) = 1 s= n+1 = F ( n) f (s)
28 Reciprocity! For Free! t 1 L P (t) = L Q (s) s=1 t 1 = ±L Q ( s) s=1 t = ±L Q (s) = ± L P ( t)
29 Reciprocity! For Free! t 1 L P (t) = L Q (s) s=1 t 1 = ±L Q ( s) s=1 t = ±L Q (s) = ± L P ( t)
30 Reciprocity! For Free! t 1 L P (t) = L Q (s) s=1 t 1 = ±L Q ( s) s=1 t = ±L Q (s) = ± L P ( t)
31 Reciprocity! For Free! t 1 L P (t) = L Q (s) s=1 t 1 = ±L Q ( s) s=1 t = ±L Q (s) = ± L P ( t)
32 Okay, Not Quite Free You do have to be careful with the triangulation and Inclusion-Exclusion for reciprocity. Need Euler characteristic, topologically or combinatorially. True of most proofs (though check out irrational version, Beck Sottile).
33 Context Classic Proofs Ehrhart, Stanley (generating functions) McMullen (valuations) Contemporary (simpler) Proofs Beck (partial fractions) Sam (full-dimensional Inclusion-Exclusion)
34 Context Classic Proofs Ehrhart, Stanley (generating functions) McMullen (valuations) Contemporary (simpler) Proofs Beck (partial fractions) Sam (full-dimensional Inclusion-Exclusion)
35 Context Classic Proofs Ehrhart, Stanley (generating functions) McMullen (valuations) Contemporary (simpler) Proofs Beck (partial fractions) Sam (full-dimensional Inclusion-Exclusion)
36 Context Classic Proofs Ehrhart, Stanley (generating functions) McMullen (valuations) Contemporary (simpler) Proofs Beck (partial fractions) Sam (full-dimensional Inclusion-Exclusion)
37 Context Classic Proofs Ehrhart, Stanley (generating functions) McMullen (valuations) Contemporary (simpler) Proofs Beck (partial fractions) Sam (full-dimensional Inclusion-Exclusion)
38 Context Classic Proofs Ehrhart, Stanley (generating functions) McMullen (valuations) Contemporary (simpler) Proofs Beck (partial fractions) Sam (full-dimensional Inclusion-Exclusion)
39 Context Classic Proofs Ehrhart, Stanley (generating functions) McMullen (valuations) Contemporary (simpler) Proofs Beck (partial fractions) Sam (full-dimensional Inclusion-Exclusion)
40 Context Classic Proofs Ehrhart, Stanley (generating functions) McMullen (valuations) Contemporary (simpler) Proofs Beck (partial fractions) Sam (full-dimensional Inclusion-Exclusion)
41 Context Classic Proofs Ehrhart, Stanley (generating functions) McMullen (valuations) Contemporary (simpler) Proofs Beck (partial fractions) Sam (full-dimensional Inclusion-Exclusion)
42 Context Classic Proofs Ehrhart, Stanley (generating functions) McMullen (valuations) Contemporary (simpler) Proofs Beck (partial fractions) Sam (full-dimensional Inclusion-Exclusion)
43 Context Classic Proofs Ehrhart, Stanley (generating functions) McMullen (valuations) Contemporary (simpler) Proofs Beck (partial fractions) Sam (full-dimensional Inclusion-Exclusion)
44 Questions Should we pick a nice basis to write (quasi-)polynomial? 1, t + 1, (t + 1)(t + 2)/2,...
45 Questions Should we pick a nice basis to write (quasi-)polynomial? 1, ( t + 1, (t + 1)(t + 2)/2,... ) ( t+d d, t+d 1 ) ( d,..., t ) d (for polynomials of degree at most d)
46 Questions Should we pick a nice basis to write (quasi-)polynomial? 1, ( t + 1, (t + 1)(t + 2)/2,... ) ( t+d d, t+d 1 ) ( d,..., t ) d (for polynomials of degree at most d) If then L P (t) = d j=0 ( ) t + d j h j, d L P (s)t s = h 0 + h 1 t + + h d t d (1 t) d+1.
47 Questions Does this translate into an algorithm? t 2s + 3 =? 4
48 Questions Does this translate into an algorithm? t 2s + 3 =? 4 t 2s + 3 3s + 2 =? 4 5
49 Questions Does this translate into an algorithm? Best I can say: t 2s + 3 =? 4 t 2s + 3 3s + 2 =? 4 5 Translate to/from generating functions (Verdoolaege W). Apply Barvinok s algorithm.
50 Thank You!
MAXIMAL 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 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 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 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 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 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 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 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 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 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 informationWeighted Ehrhart polynomials and intermediate sums on polyhedra
Weighted Ehrhart polynomials and intermediate sums on polyhedra Nicole BERLINE Centre de mathématiques Laurent Schwartz, Ecole polytechnique, France Inverse Moment Problems NUS-IMS, Dec 17, 2013 with Velleda
More informationLATTICE PLATONIC SOLIDS AND THEIR EHRHART POLYNOMIAL
Acta Math. Univ. Comenianae Vol. LXXXII, 1 (2013), pp. 147 158 147 LATTICE PLATONIC SOLIDS AND THEIR EHRHART POLYNOMIAL E. J. IONASCU Abstract. First, we calculate the Ehrhart polynomial associated with
More informationarxiv: v1 [math.ac] 6 Jan 2019
GORENSTEIN T-SPREAD VERONESE ALGEBRAS RODICA DINU arxiv:1901.01561v1 [math.ac] 6 Jan 2019 Abstract. In this paper we characterize the Gorenstein t-spread Veronese algebras. Introduction Let K be a field
More informationEhrhart Polynomials of Zonotopes
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
More informationCutting Plane Methods I
6.859/15.083 Integer Programming and Combinatorial Optimization Fall 2009 Cutting Planes Consider max{wx : Ax b, x integer}. Cutting Plane Methods I Establishing the optimality of a solution is equivalent
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 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 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 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 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 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 informationarxiv: v2 [math.co] 30 Apr 2017
COUNTING LATTICE POINTS IN FREE SUMS OF POLYTOPES ALAN STAPLEDON arxiv:1601.00177v2 [math.co] 30 Apr 2017 Abstract. We show how to compute the Ehrhart polynomial of the free sum of two lattice polytopes
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 informationCounting with rational generating functions
Counting with rational generating functions Sven Verdoolaege and Kevin Woods May 10, 007 Abstract We examine two different ways of encoding a counting function, as a rational generating function and explicitly
More informationSPECTRAHEDRA. Bernd Sturmfels UC Berkeley
SPECTRAHEDRA Bernd Sturmfels UC Berkeley Mathematics Colloquium, North Carolina State University February 5, 2010 Positive Semidefinite Matrices For a real symmetric n n-matrix A the following are equivalent:
More informationThe unreasonable ubiquitousness of quasi-polynomials
The unreasonable ubiquitousness of quasi-polynomials Kevin Woods Oberlin College, Oberlin, Ohio, USA Abstract. A function g, with domain the natural numbers, is a quasi-polynomial if there exists a period
More information2.6. Graphs of Rational Functions. Copyright 2011 Pearson, Inc.
2.6 Graphs of Rational Functions Copyright 2011 Pearson, Inc. Rational Functions What you ll learn about Transformations of the Reciprocal Function Limits and Asymptotes Analyzing Graphs of Rational Functions
More informationScissors Congruence in Mixed Dimensions
Scissors Congruence in Mixed Dimensions Tom Goodwillie Brown University Manifolds, K-Theory, and Related Topics Dubrovnik June, 2014 Plan of the talk I have been exploring the consequences of a definition.
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 informationDiscrete Geometry. Problem 1. Austin Mohr. April 26, 2012
Discrete Geometry Austin Mohr April 26, 2012 Problem 1 Theorem 1 (Linear Programming Duality). Suppose x, y, b, c R n and A R n n, Ax b, x 0, A T y c, and y 0. If x maximizes c T x and y minimizes b T
More informationSome Review Problems for Exam 3: Solutions
Math 3355 Spring 017 Some Review Problems for Exam 3: Solutions I thought I d start by reviewing some counting formulas. Counting the Complement: Given a set U (the universe for the problem), if you want
More informationLecture 1: Convex Sets January 23
IE 521: Convex Optimization Instructor: Niao He Lecture 1: Convex Sets January 23 Spring 2017, UIUC Scribe: Niao He Courtesy warning: These notes do not necessarily cover everything discussed in the class.
More informationThe Geometry of Semidefinite Programming. Bernd Sturmfels UC Berkeley
The Geometry of Semidefinite Programming Bernd Sturmfels UC Berkeley Positive Semidefinite Matrices For a real symmetric n n-matrix A the following are equivalent: All n eigenvalues of A are positive real
More informationQMI Lesson 3: Modeling with Functions
QMI Lesson 3: Modeling with Functions C C Moxley Samford University Brock School of Business Mathematical Models A mathematical model helps answer problems that arise from real-world situations. Creating
More informationCOURSE ON LMI PART I.2 GEOMETRY OF LMI SETS. Didier HENRION henrion
COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS Didier HENRION www.laas.fr/ henrion October 2006 Geometry of LMI sets Given symmetric matrices F i we want to characterize the shape in R n of the LMI set F
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 information6x 3 12x 2 7x 2 +16x 7x 2 +14x 2x 4
2.3 Real Zeros of Polynomial Functions Name: Pre-calculus. Date: Block: 1. Long Division of Polynomials. We have factored polynomials of degree 2 and some specific types of polynomials of degree 3 using
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 informationThe computation of generalized Ehrhart series and integrals in Normaliz
The computation of generalized Ehrhart series and integrals in Normaliz FB Mathematik/Informatik Universität Osnabrück wbruns@uos.de Berlin, November 2013 Normaliz and NmzIntegrate The computer program
More informationReal-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 informationThe Ehrhart polynomial of the Birkhoff polytope 1
The Ehrhart polynomial of the Birkhoff polytope Matthias Beck and Dennis Pixton All means (even continuous sanctify the discrete end. Doron Zeilberger 2 Abstract: The n th Birkhoff polytope is the set
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 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 informationValuations on Polytopes containing the Origin in their Interiors
Valuations on Polytopes containing the Origin in their Interiors Monika Ludwig Abteilung für Analysis, Technische Universität Wien Wiedner Hauptstraße 8-10/1142, 1040 Wien, Austria E-mail: monika.ludwig@tuwien.ac.at
More informationFibrations of 3-manifolds and nowhere continuous functions
Fibrations of 3-manifolds and nowhere continuous functions Balázs Strenner Georgia Institute of Technology Geometric Topology Seminar Columbia University October 5, 2018 Calculus exercise 1 Calculus exercise
More informationDETECTION OF FXM ARBITRAGE AND ITS SENSITIVITY
DETECTION OF FXM ARBITRAGE AND ITS SENSITIVITY SFI FINANCIAL ALGEBRA PROJECT AT UCC: BH, AM & EO S 1. Definitions and basics In this working paper we have n currencies, labeled 1 through n inclusive and
More information3 Finite continued fractions
MTH628 Number Theory Notes 3 Spring 209 3 Finite continued fractions 3. Introduction Let us return to the calculation of gcd(225, 57) from the preceding chapter. 225 = 57 + 68 57 = 68 2 + 2 68 = 2 3 +
More informationInteger Programming ISE 418. Lecture 12. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 12 Dr. Ted Ralphs ISE 418 Lecture 12 1 Reading for This Lecture Nemhauser and Wolsey Sections II.2.1 Wolsey Chapter 9 ISE 418 Lecture 12 2 Generating Stronger Valid
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 informationIVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS. 1. Combinatorics
IVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS Combinatorics Go over combinatorics examples in the text Review all the combinatorics problems from homewor Do at least a couple of extra
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 informationDilated Floor Functions and Their Commutators
Dilated Floor Functions and Their Commutators Jeff Lagarias, University of Michigan Ann Arbor, MI, USA (December 15, 2016) Einstein Workshop on Lattice Polytopes 2016 Einstein Workshop on Lattice Polytopes
More informationEquivariant semidefinite lifts and sum of squares hierarchies
Equivariant semidefinite lifts and sum of squares hierarchies Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology
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 informationSome Review Problems for Exam 3: Solutions
Math 3355 Fall 018 Some Review Problems for Exam 3: Solutions I thought I d start by reviewing some counting formulas. Counting the Complement: Given a set U (the universe for the problem), if you want
More informationSPECTRAHEDRA. Bernd Sturmfels UC Berkeley
SPECTRAHEDRA Bernd Sturmfels UC Berkeley GAeL Lecture I on Convex Algebraic Geometry Coimbra, Portugal, Monday, June 7, 2010 Positive Semidefinite Matrices For a real symmetric n n-matrix A the following
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 informationLinear Algebra Review: Linear Independence. IE418 Integer Programming. Linear Algebra Review: Subspaces. Linear Algebra Review: Affine Independence
Linear Algebra Review: Linear Independence IE418: Integer Programming Department of Industrial and Systems Engineering Lehigh University 21st March 2005 A finite collection of vectors x 1,..., x k R n
More informationLecture 12 Combinatorial Planning in High Dimensions
CS 460/560 Introduction to Computational Robotics Fall 017, Rutgers University Lecture 1 Combinatorial Planning in High Dimensions Instructor: Jingjin Yu Outline Review of combinatorial motion planning
More informationMidterm Preparation Problems
Midterm Preparation Problems The following are practice problems for the Math 1200 Midterm Exam. Some of these may appear on the exam version for your section. To use them well, solve the problems, then
More informationMAGIC COUNTING WITH INSIDE-OUT POLYTOPES. Louis Ng
MAGIC COUNTING WITH INSIDE-OUT POLYTOPES Louis Ng Version of May 13, 018 Contents 1 Introduction 3 Background 5 3 Methodology 6 4 Strong 4 4 Pandiagonal Magic Squares 11 4.1 Structure.....................................
More informationOn the Parameters of r-dimensional Toric Codes
On the Parameters of r-dimensional Toric Codes Diego Ruano Abstract From a rational convex polytope of dimension r 2 J.P. Hansen constructed an error correcting code of length n = (q 1) r over the finite
More informationThe Parametric Frobenius Problem
The Parametric Frobenius Problem Bjarke Hammersholt Roune Department of Mathematics University of Kaiserslautern Kaiserslautern, Germany bjarke.roune@gmail.com Kevin Woods Department of Mathematics Oberlin
More informationChapter 0 Preliminaries
Chapter 0 Preliminaries MA1101 Mathematics 1A Semester I Year 2017/2018 FTMD & FTI International Class Odd NIM (K-46) Lecturer: Dr. Rinovia Simanjuntak 0.1 Real Numbers and Logic Real Numbers Repeating
More information4. Images of Varieties Given a morphism f : X Y of quasi-projective varieties, a basic question might be to ask what is the image of a closed subset
4. Images of Varieties Given a morphism f : X Y of quasi-projective varieties, a basic question might be to ask what is the image of a closed subset Z X. Replacing X by Z we might as well assume that Z
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 informationCarnegie Learning Middle School Math Series: Grade 8 Indiana Standards Worktext Correlations
8.NS.1 Give examples of rational and irrational numbers and explain the difference between them. Understand that every number has a decimal expansion; for rational numbers, show that the decimal expansion
More informationarxiv:math/ v2 [math.co] 9 Oct 2008
arxiv:math/070866v2 [math.co] 9 Oct 2008 A GENERATING FUNCTION FOR ALL SEMI-MAGIC SQUARES AND THE VOLUME OF THE BIRKHOFF POLYTOPE J.A. DE LOERA, F. LIU, AND R. YOSHIDA Abstract. We present a multivariate
More informationLMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009
LMI MODELLING 4. CONVEX LMI MODELLING Didier HENRION LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ Universidad de Valladolid, SP March 2009 Minors A minor of a matrix F is the determinant of a submatrix
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 informationComplex Numbers: Definition: A complex number is a number of the form: z = a + bi where a, b are real numbers and i is a symbol with the property: i
Complex Numbers: Definition: A complex number is a number of the form: z = a + bi where a, b are real numbers and i is a symbol with the property: i 2 = 1 Sometimes we like to think of i = 1 We can treat
More informationMSRI Summer Graduate Workshop: Algebraic, Geometric, and Combinatorial Methods for Optimization. Part IV
MSRI Summer Graduate Workshop: Algebraic, Geometric, and Combinatorial Methods for Optimization Part IV Geometry of Numbers and Rational Generating Function Techniques for Integer Programming Matthias
More informationTopology of Toric Varieties, Part II
Topology of Toric Varieties, Part II Daniel Chupin April 2, 2018 Abstract Notes for a talk leading up to a discussion of the Hirzebruch-Riemann-Roch (HRR) theorem for toric varieties, and some consequences
More informationarxiv: v1 [math.co] 30 Sep 2017
LAPLACIAN SIMPLICES ASSOCIATED TO DIGRAPHS GABRIELE BALLETTI, TAKAYUKI HIBI, MARIE MEYER, AND AKIYOSHI TSUCHIYA arxiv:70.005v [math.co] 0 Sep 07 Abstract. We associate to a finite digraph D a lattice polytope
More informationOnline Courses for High School Students
Online Courses for High School Students 1-888-972-6237 Algebra I Course Description: Students explore the tools of algebra and learn to identify the structure and properties of the real number system;
More informationCOUNTING INTEGER POINTS IN POLYHEDRA. Alexander Barvinok
COUNTING INTEGER POINTS IN POLYHEDRA Alexander Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html Let P R d be a polytope. We want to compute (exactly or approximately)
More informationSampling Contingency Tables
Sampling Contingency Tables Martin Dyer Ravi Kannan John Mount February 3, 995 Introduction Given positive integers and, let be the set of arrays with nonnegative integer entries and row sums respectively
More informationAn Algorithmic Theory of Lattice Points in Polyhedra
New Perspectives in Geometric Combinatorics MSRI Publications Volume 38, 1999 An Algorithmic Theory of Lattice Points in Polyhedra ALEXANDER BARVINOK AND JAMES E. POMMERSHEIM Abstract. We discuss topics
More information- Common work with Nicole Berline. Preprint in arkiv; CO/ Thanks to Charles Cochet for drawings (the good ones).
Euler-Maclaurin formula for polytopes.. p.1 - Common work with Nicole Berline. Preprint in arkiv; CO/0507256. - Thanks to Charles Cochet for drawings (the good ones). Euler-Maclaurin formula in dimension
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 informationarxiv:math.ag/ v1 7 Jan 2005
arxiv:math.ag/0501104 v1 7 Jan 2005 Asymptotic cohomological functions of toric divisors Milena Hering, Alex Küronya, Sam Payne January 7, 2005 Abstract We study functions on the class group of a toric
More informationPARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS
PARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS GEORGE E. ANDREWS, MATTHIAS BECK, AND NEVILLE ROBBINS Abstract. We study the number p(n, t) of partitions of n with difference t between
More informationMidterm 2 Sample Introduction to Higher Math Fall 2018 Instructor: Linh Truong
Midterm Sample Introduction to Higher Math Fall 018 Instructor: Linh Truong Name: Instructions: Print your name in the space above. Show your reasoning. Write complete proofs. You have 75 minutes. No notes,
More informationNon-Attacking Chess Pieces: The Bishop
Non-Attacking Chess Pieces: The Bishop Thomas Zaslavsky Binghamton University (State University of New York) C R Rao Advanced Institute of Mathematics, Statistics and Computer Science 9 July 010 Joint
More informationSection 4.1: Sequences and Series
Section 4.1: Sequences and Series In this section, we shall introduce the idea of sequences and series as a necessary tool to develop the proof technique called mathematical induction. Most of the material
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 informationOutline. Some Reflection Group Numerology. Root Systems and Reflection Groups. Example: Symmetries of a triangle. Paul Renteln
Outline 1 California State University San Bernardino and Caltech 2 Queen Mary University of London June 13, 2014 3 Root Systems and Reflection Groups Example: Symmetries of a triangle V an n dimensional
More informationMatthew Wright Institute for Mathematics and its Applications University of Minnesota. Applied Topology in Będlewo July 24, 2013
Matthew Wright Institute for Mathematics and its Applications University of Minnesota Applied Topology in Będlewo July 24, 203 How can we assign a notion of size to functions? Lebesgue integral Anything
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 informationContinuity. The Continuity Equation The equation that defines continuity at a point is called the Continuity Equation.
Continuity A function is continuous at a particular x location when you can draw it through that location without picking up your pencil. To describe this mathematically, we have to use limits. Recall
More informationsatisfying ( i ; j ) = ij Here ij = if i = j and 0 otherwise The idea to use lattices is the following Suppose we are given a lattice L and a point ~x
Dual Vectors and Lower Bounds for the Nearest Lattice Point Problem Johan Hastad* MIT Abstract: We prove that given a point ~z outside a given lattice L then there is a dual vector which gives a fairly
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationMinkowski Length of Lattice Polytopes
Minkowski Length of Lattice Polytopes Einstein Workshop on Lattice Polytopes Ivan Soprunov (with Jenya Soprunova) Cleveland State University December 12, 2016 Ivan Soprunov (with Jenya Soprunova), Cleveland
More informationLocally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem
56 Chapter 7 Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem Recall that C(X) is not a normed linear space when X is not compact. On the other hand we could use semi
More informationEhrhart polynome: how to compute the highest degree coefficients and the knapsack problem.
Ehrhart polynome: how to compute the highest degree coefficients and the knapsack problem. Velleda Baldoni Università di Roma Tor Vergata Optimization, Moment Problems and Geometry I, IMS at NUS, Singapore-
More informationNOTES ON POINCARÉ SERIES OF FINITE AND AFFINE COXETER GROUPS
NOTES ON POINCARÉ SERIES OF FINITE AND AFFINE COXETER GROUPS VICTOR REINER Abstract. There are two famous formulae relating the Poincaré series of a finite/affine Weyl group to the degrees of fundamental
More informationNotice that we are switching from the subtraction to adding the negative of the following term
MTH95 Day 6 Sections 5.3 & 7.1 Section 5.3 Polynomials and Polynomial Functions Definitions: Term Constant Factor Coefficient Polynomial Monomial Binomial Trinomial Degree of a term Degree of a Polynomial
More informationMath 320-2: Midterm 2 Practice Solutions Northwestern University, Winter 2015
Math 30-: Midterm Practice Solutions Northwestern University, Winter 015 1. Give an example of each of the following. No justification is needed. (a) A metric on R with respect to which R is bounded. (b)
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 informationBigraphical arrangements
Bigraphical arrangements FPSAC 14, Chicago Sam Hopkins and David Perkinson MIT and Reed College July 2nd, 2014 Sam Hopkins and David Perkinson (2014) Bigraphical arrangements July 2nd, 2014 1 / 26 History
More information