Computing the continuous discretely: The magic quest for a volume
|
|
- Marshall Glenn
- 6 years ago
- Views:
Transcription
1 Computing the continuous discretely: The magic quest for a volume Matthias Beck San Francisco State University math.sfsu.edu/beck
2 Joint work with... Dennis Pixton (Birkhoff volume) Ricardo Diaz and Sinai Robins (Fourier-Dedekind sums) Ira Gessel and Takao Komatsu (restricted partition function) Jesus De Loera, Mike Develin, Julian Pfeifle, Richard Stanley (roots of Ehrhart polynomials) Integer-point enumeration in polytopes Matthias Beck 2
3 Birkhoff polytope B n = x 11 x 1n.. x n1... x nn R n2 0 : j x jk = 1 for all 1 k n k x jk = 1 for all 1 j n Integer-point enumeration in polytopes Matthias Beck 3
4 Birkhoff polytope B n = x 11 x 1n.. x n1... x nn R n2 0 : j x jk = 1 for all 1 k n k x jk = 1 for all 1 j n B n is a convex polytope of dimension (n 1) 2 Vertices are the n n-permutation matrices. Integer-point enumeration in polytopes Matthias Beck 3
5 Birkhoff polytope B n = x 11 x 1n.. x n1... x nn R n2 0 : j x jk = 1 for all 1 k n k x jk = 1 for all 1 j n B n is a convex polytope of dimension (n 1) 2 Vertices are the n n-permutation matrices. vol B n =? Integer-point enumeration in polytopes Matthias Beck 3
6 Birkhoff polytope B n = x 11 x 1n.. x n1... x nn R n2 0 : j x jk = 1 for all 1 k n k x jk = 1 for all 1 j n B n is a convex polytope of dimension (n 1) 2 Vertices are the n n-permutation matrices. vol B n =? ( One approach: for X R d # ) tx Z d, vol X = lim t t d Integer-point enumeration in polytopes Matthias Beck 3
7 (Weak) semimagic squares H n (t) := # (tb n Z n2) = # x 11 x 1n.. x n1... x nn Z n2 0 : j x jk = t k x jk = t Integer-point enumeration in polytopes Matthias Beck 4
8 (Weak) semimagic squares H n (t) := # (tb n Z n2) = # x 11 x 1n.. x n1... x nn Z n2 0 : j x jk = t k x jk = t Theorem (Ehrhart, Stanley 1973, conjectured by Anand-Dumir-Gupta 1966) H n (t) is a polynomial in t of degree (n 1) 2. Integer-point enumeration in polytopes Matthias Beck 4
9 (Weak) semimagic squares H n (t) := # (tb n Z n2) = # x 11 x 1n.. x n1... x nn Z n2 0 : j x jk = t k x jk = t Theorem (Ehrhart, Stanley 1973, conjectured by Anand-Dumir-Gupta 1966) H n (t) is a polynomial in t of degree (n 1) 2. For example... H 1 (t) = 1 H 2 (t) = t + 1 (MacMahon 1905) H 3 (t) = 3 ( t+3 4 ) ( + t+2 ) 2 = 1 8 t t t t + 1 Integer-point enumeration in polytopes Matthias Beck 4
10 Ehrhart quasi-polynomials Rational (convex) polytope P convex hull of finitely many points in Q d Alternative description: P = { x R d : A x b } { x R d 0 : A x = b} Integer-point enumeration in polytopes Matthias Beck 5
11 Ehrhart quasi-polynomials Rational (convex) polytope P convex hull of finitely many points in Q d Alternative description: P = { x R d : A x b } { x R d 0 : A x = b} For t Z >0, let L P (t) := # ( tp Z d) Integer-point enumeration in polytopes Matthias Beck 5
12 Ehrhart quasi-polynomials Rational (convex) polytope P convex hull of finitely many points in Q d Alternative description: P = { x R d : A x b } { x R d 0 : A x = b} For t Z >0, let L P (t) := # ( tp Z d) Quasi-polynomial c d (t) t d + c d 1 (t) t d c 0 (t) where c k (t) are periodic Theorem (Ehrhart 1967) If P is a rational polytope, then... L P (t) and L P (t) are quasi-polynomials in t of degree dim P If P has integer vertices, then L P and L P are polynomials Leading term: vol(p ) (suitably normalized) L P (0) = χ(p ) (Macdonald 1970) L P ( t) = ( 1) dim P L P (t) Integer-point enumeration in polytopes Matthias Beck 5
13 (Weak) semimagic squares revisited H n (t) = L Bn (t) = # x 11 x 1n.. x n1... x nn L B n (t) = # x 11 x 1n.. x n1... x nn Z n2 0 : Z n2 >0 : j x jk = t k x jk = t j x jk = t k x jk = t Integer-point enumeration in polytopes Matthias Beck 6
14 (Weak) semimagic squares revisited H n (t) = L Bn (t) = # x 11 x 1n.. x n1... x nn L B n (t) = # x 11 x 1n.. x n1... x nn Z n2 0 : Z n2 >0 : j x jk = t k x jk = t j x jk = t k x jk = t L B n (t) = L Bn (t n), so by Ehrhart-Macdonald reciprocity (Ehrhart, Stanley 1973) H n ( n t) = ( 1) (n 1)2 H n (t) H n ( 1) = = H n ( n + 1) = 0. Integer-point enumeration in polytopes Matthias Beck 6
15 Computation of Ehrhart (quasi-)polynomials Pommersheim (1993): 3-dimensional tetrahedra connection to Dedekind sum b 1 cot πka πk cot b b k=1 Integer-point enumeration in polytopes Matthias Beck 7
16 Computation of Ehrhart (quasi-)polynomials Pommersheim (1993): 3-dimensional tetrahedra connection to Dedekind sum b 1 cot πka πk cot b b k=1 Barvinok (1993): In fixed dimension, t 0 L P(t) x t is polynomial-time computable Integer-point enumeration in polytopes Matthias Beck 7
17 Computation of Ehrhart (quasi-)polynomials Pommersheim (1993): 3-dimensional tetrahedra connection to Dedekind sum b 1 cot πka πk cot b b k=1 Barvinok (1993): In fixed dimension, t 0 L P(t) x t is polynomial-time computable Formulas by Danilov, Brion-Vergne, Kantor-Khovanskii-Puklikov, Diaz- Robins, Chen, Baldoni-DeLoera-Szenes-Vergne, Lasserre-Zeron,... Integer-point enumeration in polytopes Matthias Beck 7
18 Euler s generating function P := { x R d 0 : A x = b} A = c 1 c 2 c d Integer-point enumeration in polytopes Matthias Beck 8
19 Euler s generating function P := { x R d 0 : A x = b} A = c 1 c 2 c d L P (t) equals the coefficient of z tb := z tb 1 1 z tb m m 1 (1 z c 1 ) (1 z c d ) of the function expanded as a power series centered at z = 0. Integer-point enumeration in polytopes Matthias Beck 8
20 Euler s generating function P := { x R d 0 : A x = b} A = c 1 c 2 c d L P (t) equals the coefficient of z tb := z tb 1 1 z tb m m 1 (1 z c 1 ) (1 z c d ) of the function expanded as a power series centered at z = 0. Proof Expand each factor into a geometric series. Integer-point enumeration in polytopes Matthias Beck 8
21 Euler s generating function P := { x R d 0 : A x = b} A = c 1 c 2 c d L P (t) equals the coefficient of z tb := z tb 1 1 z tb m m 1 (1 z c 1 ) (1 z c d ) of the function expanded as a power series centered at z = 0. Proof Expand each factor into a geometric series. Equivalently, L P (t) = const 1 (1 z c 1 ) (1 z c d ) z tb Integer-point enumeration in polytopes Matthias Beck 8
22 Partition functions and the Frobenius problem Restricted partition function for A = {a 1,..., a d } p A (t) = # { (m 1,..., m d ) Z d 0 : m 1 a m d a d = t } Integer-point enumeration in polytopes Matthias Beck 9
23 Partition functions and the Frobenius problem Restricted partition function for A = {a 1,..., a d } p A (t) = # { (m 1,..., m d ) Z d 0 : m 1 a m d a d = t } Frobenius problem: find the largest value for t such that p A (t) = 0 Integer-point enumeration in polytopes Matthias Beck 9
24 Partition functions and the Frobenius problem Restricted partition function for A = {a 1,..., a d } p A (t) = # { (m 1,..., m d ) Z d 0 : m 1 a m d a d = t } Frobenius problem: find the largest value for t such that p A (t) = 0 p A (t) = L P (t) where P = { (x 1,..., x d ) R d 0 : x 1 a x d a d = 1 } Integer-point enumeration in polytopes Matthias Beck 9
25 Partition functions and the Frobenius problem Restricted partition function for A = {a 1,..., a d } p A (t) = # { (m 1,..., m d ) Z d 0 : m 1 a m d a d = t } Frobenius problem: find the largest value for t such that p A (t) = 0 p A (t) = L P (t) where P = { (x 1,..., x d ) R d 0 : x 1 a x d a d = 1 } Hence p A (t) is a quasipolynomial in t of degree d 1 and period lcm(a 1,..., a d ). p A (t) = const 1 (1 z a 1 )(1 z a 2) (1 z a d )z t Integer-point enumeration in polytopes Matthias Beck 9
26 Fourier-Dedekind sum defined for c 1,..., c d Z relatively prime to c Z and n Z σ n (c 1,..., c d ; c) = 1 c λ c =1 λ λ n (1 λ c 1 ) (1 λ c d ) Integer-point enumeration in polytopes Matthias Beck 10
27 Fourier-Dedekind sum defined for c 1,..., c d Z relatively prime to c Z and n Z σ n (c 1,..., c d ; c) = 1 c λ c =1 λ λ n (1 λ c 1 ) (1 λ c d ) Theorem If a 1,..., a d are pairwise relatively prime then p A (t) = P A (t) + d σ t (a 1,..., â j,..., a d ; a j ) j=1 where P A (t) = 1 a 1 a d d 1 m=0 ( 1) m (d 1 m)! a k 1 k 1 + +k d =m 1 ak d d B k1 B kd k 1! k d! t d 1 m Integer-point enumeration in polytopes Matthias Beck 10
28 Examples of Fourier-Dedekind sums σ n (c 1,..., c d ; c) = 1 c λ c =1 λ λ n (1 λ c 1 ) (1 λ c d ) σ n (1; c) = (( )) n c + 1 2c where ((x)) = x x 1/2 Integer-point enumeration in polytopes Matthias Beck 11
29 Examples of Fourier-Dedekind sums σ n (c 1,..., c d ; c) = 1 c λ c =1 λ λ n (1 λ c 1 ) (1 λ c d ) σ n (1; c) = (( )) n c + 1 2c where ((x)) = x x 1/2 c 1 (( a 1 )) (bm + n) ((m )) σ n (a, b; c) = c c m=0 the Dedekind-Rademacher sum 1, a special case of 4c Integer-point enumeration in polytopes Matthias Beck 11
30 Examples of Fourier-Dedekind sums σ n (c 1,..., c d ; c) = 1 c λ c =1 λ λ n (1 λ c 1 ) (1 λ c d ) σ n (1; c) = (( )) n c + 1 2c where ((x)) = x x 1/2 c 1 (( a 1 )) (bm + n) ((m )) σ n (a, b; c) = c c m=0 the Dedekind-Rademacher sum 1, a special case of 4c Corollaries Pommersheim formulas Ehrhart quasipolynomials of all rational polygons (d = 2) can be computed using Dedekind-Rademacher sums Integer-point enumeration in polytopes Matthias Beck 11
31 Corollaries due to Ehrhart theory p A ( t) = ( 1) d 1 p A (t (a a d )) Integer-point enumeration in polytopes Matthias Beck 12
32 Corollaries due to Ehrhart theory p A ( t) = ( 1) d 1 p A (t (a a d )) If 0 < t < a a d then d σ t (a 1,..., â j,..., a d ; a j ) = P A (t) j=1 (Specializes to reciprocity laws for generalized Dedekind sums due to Rademacher and Gessel) Integer-point enumeration in polytopes Matthias Beck 12
33 Corollaries due to Ehrhart theory p A ( t) = ( 1) d 1 p A (t (a a d )) If 0 < t < a a d then d σ t (a 1,..., â j,..., a d ; a j ) = P A (t) j=1 (Specializes to reciprocity laws for generalized Dedekind sums due to Rademacher and Gessel) d σ 0 (a 1,..., â j,..., a d ; a j ) = 1 P A (0) j=1 (Equivalent to Zagier s higher dimensional Dedekind sums reciprocity law) Integer-point enumeration in polytopes Matthias Beck 12
34 Back to Birkhoff... B n = = x 11 x 1n.. R n2 0 : x n1... x nn } {x R n2 0 : A x = 1 j x jk = 1 k x jk = 1 with A = Integer-point enumeration in polytopes Matthias Beck 13
35 Back to Birkhoff... with A = B n = } {x R n2 0 : A x = (z 1 z 2n ) t H n (t) = const (1 z 1 z n+1 )(1 z 1 z n+2 ) (1 z n z 2n ) ( ( = const z (z 1 z n ) t w t 1 ) n ) const w (1 z 1 w) (1 z n w) ( ( n ) n ) = const (z 1 z n ) t z t+n 1 k j k (z k z j ) k=1 Integer-point enumeration in polytopes Matthias Beck 13
36 n = 3 H 3 (t) = const(z 1 z 2 z 3 ) t ( z1 t+2 (z 1 z 2 )(z 1 z 3 ) + z2 t+2 (z 2 z 1 )(z 2 z 3 ) + z3 t+2 (z 3 z 1 )(z 3 z 2 ) ) 3 Integer-point enumeration in polytopes Matthias Beck 14
37 n = 3 H 3 (t) = const(z 1 z 2 z 3 ) t ( z1 t+2 (z 1 z 2 )(z 1 z 3 ) + z2 t+2 (z 2 z 1 )(z 2 z 3 ) + z3 t+2 (z 3 z 1 )(z 3 z 2 ) = const z1 2t+6 z2 t z t 3 (z 1 z 2 ) 3 (z 1 z 3 ) 3 3 const z t+4 1 z2z 2 3 t (z 1 z 2 ) 3 (z 1 z 3 ) 2 (z 2 z 3 ) ) 3 Integer-point enumeration in polytopes Matthias Beck 14
38 n = 3 H 3 (t) = const(z 1 z 2 z 3 ) t ( z1 t+2 (z 1 z 2 )(z 1 z 3 ) + z2 t+2 (z 2 z 1 )(z 2 z 3 ) + z3 t+2 (z 3 z 1 )(z 3 z 2 ) = const = const z1 ( = z1 2t+6 z2 t z t 3 (z 1 z 2 ) 3 (z 1 z 3 ) 3 3 const z t+4 z 2t+6 1 ( ) 2 ( ) t + 2 t (const z z t (z 1 z) 3 1 z2z 2 3 t (z 1 z 2 ) 3 (z 1 z 3 ) 2 (z 2 z 3 ) ) 2 ) 3 const zt+4 1 z3 t (z 1 z 3 ) 5 = 1 8 t t t t + 1 ) 3 Integer-point enumeration in polytopes Matthias Beck 14
39 n = 3 H 3 (t) = const(z 1 z 2 z 3 ) t ( z1 t+2 (z 1 z 2 )(z 1 z 3 ) + z2 t+2 (z 2 z 1 )(z 2 z 3 ) + z3 t+2 (z 3 z 1 )(z 3 z 2 ) = const = const z1 ( = z1 2t+6 z2 t z t 3 (z 1 z 2 ) 3 (z 1 z 3 ) 3 3 const z t+4 z 2t+6 1 ( ) 2 ( ) t + 2 t (const z z t (z 1 z) 3 1 z2z 2 3 t (z 1 z 2 ) 3 (z 1 z 3 ) 2 (z 2 z 3 ) ) 2 ) 3 const zt+4 1 z3 t (z 1 z 3 ) 5 = 1 8 t t t t + 1 = vol B 3 = = 9 8 ) 3 Integer-point enumeration in polytopes Matthias Beck 14
40 n = 4 After computing five constant terms... ( ) 3 t + 3 H 4 (t) = + 6 ( 2t 2 + 5t + 1 ) ( ) ( ) t + 5 t (t + 4) ( ) ( ) ( ) ( ) t + 6 2t + 8 t + 5 t (t + 1) = t t t t t t t t t + 1 vol B 4 = = The relative volume of the fundamental domain of the sublattice of Z n2 in the affine space spanned by B n is n n 1. Integer-point enumeration in polytopes Matthias Beck 15
41 General n H n (t) = const(z 1 z n ) t ( ) n ( n z t+n 1 k m 1,..., m n j k (z k z j ) m 1 + +m n =n k=1 ) mk where denotes that we only sum over those n-tuples of non-negative integers satisfying m m n = n and m m r > r if 1 r < n. Integer-point enumeration in polytopes Matthias Beck 16
42 General n H n (t) = const(z 1 z n ) t ( ) n ( n z t+n 1 k m 1,..., m n j k (z k z j ) m 1 + +m n =n k=1 ) mk where denotes that we only sum over those n-tuples of non-negative integers satisfying m m n = n and m m r > r if 1 r < n. Computational concerns: (2n 2)! # terms in the sum is C n 1 = (n)!(n 1)! Iterated constant-term computation Integer-point enumeration in polytopes Matthias Beck 16
43 Analytic speed-up tricks Realize when a z k -constant term is zero Integer-point enumeration in polytopes Matthias Beck 17
44 Analytic speed-up tricks Realize when a z k -constant term is zero Choose most efficient order of iterated constant term computation Integer-point enumeration in polytopes Matthias Beck 17
45 Analytic speed-up tricks Realize when a z k -constant term is zero Choose most efficient order of iterated constant term computation Factor constant-term computation if some of the variables appear in a symmetric fashion Integer-point enumeration in polytopes Matthias Beck 17
46 Analytic speed-up tricks Realize when a z k -constant term is zero Choose most efficient order of iterated constant term computation Factor constant-term computation if some of the variables appear in a symmetric fashion If only interested in vol B n, we may dispense a particular constant term if it does not contribute to leading term of H n. Integer-point enumeration in polytopes Matthias Beck 17
47 Volumes of B n n vol B n / / / / Integer-point enumeration in polytopes Matthias Beck 18
48 Volumes of B n n vol B n / / / / Integer-point enumeration in polytopes Matthias Beck 18
49 Computation times n computing time for vol B n 1 <.01 sec 2 <.01 sec 3 <.01 sec 4 <.01 sec 5 <.01 sec 6.18 sec 7 15 sec 8 54 min hr d (scaled to a 1GHz processor running Linux) Integer-point enumeration in polytopes Matthias Beck 19
50 Coefficients and roots of Ehrhart polynomials Lattice (convex) polytope P convex hull of finitely many points in Z d Then L P (t) = c d t d + + c 0 is a polynomial in t. Integer-point enumeration in polytopes Matthias Beck 20
51 Coefficients and roots of Ehrhart polynomials Lattice (convex) polytope P convex hull of finitely many points in Z d Then L P (t) = c d t d + + c 0 is a polynomial in t We know (intrinsic) geometric interpretations of c d, c d 1, and c 0. What about the other coefficients? Integer-point enumeration in polytopes Matthias Beck 20
52 Coefficients and roots of Ehrhart polynomials Lattice (convex) polytope P convex hull of finitely many points in Z d Then L P (t) = c d t d + + c 0 is a polynomial in t We know (intrinsic) geometric interpretations of c d, c d 1, and c 0. What about the other coefficients? What can be said about the roots of Ehrhart polynomials? Integer-point enumeration in polytopes Matthias Beck 20
53 Coefficients and roots of Ehrhart polynomials Lattice (convex) polytope P convex hull of finitely many points in Z d Then L P (t) = c d t d + + c 0 is a polynomial in t We know (intrinsic) geometric interpretations of c d, c d 1, and c 0. What about the other coefficients? What can be said about the roots of Ehrhart polynomials? Theorem (Stanley 1980) The generating function t 0 L P(t) x t can be written in the form f(x), where f(x) is a polynomial of degree at most (1 x) d+1 d with nonnegative integer coefficients. Integer-point enumeration in polytopes Matthias Beck 20
54 Coefficients and roots of Ehrhart polynomials Lattice (convex) polytope P convex hull of finitely many points in Z d Then L P (t) = c d t d + + c 0 is a polynomial in t We know (intrinsic) geometric interpretations of c d, c d 1, and c 0. What about the other coefficients? What can be said about the roots of Ehrhart polynomials? Theorem (Stanley 1980) The generating function t 0 L P(t) x t can be written in the form f(x), where f(x) is a polynomial of degree at most (1 x) d+1 d with nonnegative integer coefficients. The inequalities f(x) 0 and c d 1 > 0 are currently the sharpest constraints on Ehrhart coefficients. Are there others? Integer-point enumeration in polytopes Matthias Beck 21
55 Roots of Ehrhart polynomials are special Easy fact: L P has no integer roots besides d, d + 1,..., 1. Integer-point enumeration in polytopes Matthias Beck 22
56 Roots of Ehrhart polynomials are special Easy fact: L P has no integer roots besides d, d + 1,..., 1. Theorem (1) The roots of Ehrhart polynomials of lattice d-polytopes are bounded in norm by 1 + (d + 1)!. (2) All real roots are in [ d, d/2 ). (3) For any positive real number r there exist an Ehrhart polynomial of sufficiently large degree with a real root strictly larger than r. Integer-point enumeration in polytopes Matthias Beck 22
57 Roots of Ehrhart polynomials are special Easy fact: L P has no integer roots besides d, d + 1,..., 1. Theorem (1) The roots of Ehrhart polynomials of lattice d-polytopes are bounded in norm by 1 + (d + 1)!. (2) All real roots are in [ d, d/2 ). (3) For any positive real number r there exist an Ehrhart polynomial of sufficiently large degree with a real root strictly larger than r. Improve the bound in (1). The upper bound in (2) is not sharp, for example, it can be improved to 1 for dim P = 4. Can one obtain a better (general) upper bound? Integer-point enumeration in polytopes Matthias Beck 22
58 Roots of Ehrhart polynomials are special Easy fact: L P has no integer roots besides d, d + 1,..., 1. Theorem (1) The roots of Ehrhart polynomials of lattice d-polytopes are bounded in norm by 1 + (d + 1)!. (2) All real roots are in [ d, d/2 ). (3) For any positive real number r there exist an Ehrhart polynomial of sufficiently large degree with a real root strictly larger than r. Improve the bound in (1). The upper bound in (2) is not sharp, for example, it can be improved to 1 for dim P = 4. Can one obtain a better (general) upper bound? Conjecture: All roots α satisfy d Re α d 1. Integer-point enumeration in polytopes Matthias Beck 23
59 Roots of the Birkhoff polytopes Integer-point enumeration in polytopes Matthias Beck 24
60 Roots of some tetrahedra Integer-point enumeration in polytopes 2 Matthias Beck
Enumerating 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 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 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 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 informationDedekind sums: a combinatorial-geometric viewpoint
DIMACS Series in Discrete Mathematics and Theoretical Computer Science Dedekind sums: a cominatorial-geometric viewpoint Matthias Beck and Sinai Roins Astract The literature on Dedekind sums is vast In
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 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 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 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 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 informationThe Arithmetic of Rational Polytopes
The Arithmetic of Rational Polytopes A Dissertation Submitted to the Temple University Graduate Board in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy by Matthias Beck August
More informationThe polynomial part of a restricted partition function related to the Frobenius problem
The polynomial part of a restricted partition function related to the Frobenius problem Matthias Beck Department of Mathematical Sciences State University of New York Binghamton, NY 3902 6000, USA matthias@math.binghamton.edu
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 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 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 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 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 informationEquality of Dedekind sums: experimental data and theory
Equality of Dedekind sums: experimental data and theory Challenges in 21st Century Experimental Mathematical Computation Sinai Robins Nanyang Technological University ICERM Brown University What are Dedekind
More informationAN ALTERNATIVE ALGORITHM FOR COUNTING LATTICE POINTS IN A CONVEX POLYTOPE. 1. Introduction. Consider the (not necessarily compact) polyhedron
AN ALTERNATIVE ALGORITHM FOR COUNTING LATTICE POINTS IN A CONVEX POLYTOPE JEAN B. LASSERRE AND EDUARDO S. ZERON Abstract. We provide an alternative algorithm for counting lattice points in the convex polytope
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 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 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 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 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 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 informationDUALITY AND INTEGER PROGRAMMING. Jean B. LASSERRE
LABORATOIRE d ANALYSE et d ARCHITECTURE des SYSTEMES DUALITY AND INTEGER PROGRAMMING Jean B. LASSERRE 1 Current solvers (CPLEX, XPRESS-MP) are rather efficient and can solve many large size problems with
More informationSix Little Squares and How Their Numbers Grow
3 47 6 3 Journal of Integer Sequences, Vol. 3 (00), Article 0.3.8 Six Little Squares and How Their Numbers Grow Matthias Beck Department of Mathematics San Francisco State University 600 Holloway Avenue
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 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 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 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 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 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 informationInteger knapsacks and the Frobenius problem. Lenny Fukshansky Claremont McKenna College
Integer knapsacks and the Frobenius problem Lenny Fukshansky Claremont McKenna College Claremont Statistics, Operations Research, and Math Finance Seminar April 21, 2011 1 Integer knapsack problem Given
More informationarxiv:math/ v1 [math.ag] 14 Feb 2007
arxiv:math/0702406v [math.ag] 4 Feb 2007 SIMPLE EXPLICIT FORMULA FOR COUNTING LATTICE POINTS OF POLYHEDRA JEAN B. LASSERRE AND EDUARDO S. ZERON Abstract. Given z C n and A Z m n, we consider the problem
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 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 informationA generating function for all semi-magic squares and the volume of the Birkhoff polytope
DOI 0.007/s080-008-055-y A generating function for all semi-magic squares and the volume of the Birkhoff polytope J.A. De Loera F. Liu R. Yoshida Received: 2 June 2008 / Accepted: 5 September 2008 Springer
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 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 informationarxiv: v1 [math.co] 10 Aug 2016
POLYTOPES OF STOCHASTIC TENSORS HAIXIA CHANG 1, VEHBI E. PAKSOY 2 AND FUZHEN ZHANG 2 arxiv:1608.03203v1 [math.co] 10 Aug 2016 Abstract. Considering n n n stochastic tensors (a ijk ) (i.e., nonnegative
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 informationA Generating-Function Approach for Reciprocity Formulae of Dedekind-like Sums
A Generating-Function Approach for Reciprocity Formulae of Dedekind-like Sums Jordan Clark Morehouse College Stefan Klajbor University of Puerto Rico, Rio Piedras Chelsie Norton Valdosta State July 28,
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 informationProblems from the Cottonwood Room.
Contemporary Mathematics Problems from the Cottonwood Room. Matthias Beck, Beifang Chen, Lenny Fukshansky, Christian Haase, Allen Knutson, Bruce Reznick, Sinai Robins, and Achill Schürmann Abstract. This
More informationA LATTICE POINT ENUMERATION APPROACH TO PARTITION IDENTITIES
A LATTICE POINT ENUMERATION APPROACH TO PARTITION IDENTITIES A thesis presented to the faculty of San Francisco State University In partial fulfilment of The Requirements for The Degree Master of Arts
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 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 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 informationA Fast Algorithm for MacMahon s Partition Analysis
A Fast Algorithm for MacMahon s Partition Analysis Guoce Xin Department of Mathematics Brandeis University, Waltham, USA maxima@brandeis.edu Submitted: Aug 26, 2004; Accepted: Aug 30, 2004; Published:
More informationarxiv:math/ v1 [math.rt] 9 Jun 2005
arxiv:math/0506159v1 [math.rt] 9 Jun 2005 Vector partition function and representation theory Charles Cochet Abstract. We apply some recent developments of Baldoni-Beck-Cochet- Vergne [BBCV05] on vector
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 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 informationDimension Quasi-polynomials of Inversive Difference Field Extensions with Weighted Translations
Dimension Quasi-polynomials of Inversive Difference Field Extensions with Weighted Translations Alexander Levin The Catholic University of America Washington, D. C. 20064 Spring Eastern Sectional AMS Meeting
More information, when k is fixed. We give a number of results in. k q. this direction, some of which involve Eulerian polynomials and their generalizations.
SOME ASYMPTOTIC RESULTS ON -BINOMIAL COEFFICIENTS RICHARD P STANLEY AND FABRIZIO ZANELLO Abstract We loo at the asymptotic behavior of the coefficients of the -binomial coefficients or Gaussian polynomials,
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 informationOn the Sylvester Denumerants for General Restricted Partitions
On the Sylvester Denumerants for General Restricted Partitions Geir Agnarsson Abstract Let n be a nonnegative integer and let ã = (a 1... a k be a k-tuple of positive integers. The term denumerant introduced
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 points in simple polytopes
Lattice points in simple polytopes Michel Brion and Michèle Vergne May 995 Introduction Consider a convex n-dimensional polytope P in R n with all vertices in the lattice Z n. In this article, we give
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] 30 Oct 2010
Generalized Ehrhart polynomials Sheng Chen, Nan Li, and Steven V Sam October 29, 2010 arxiv:1002.3658v2 [math.co] 30 Oct 2010 Abstract Let P be a polytope with rational vertices. A classical theorem of
More informationINTRODUCTION TO FINITE ELEMENT METHODS
INTRODUCTION TO FINITE ELEMENT METHODS LONG CHEN Finite element methods are based on the variational formulation of partial differential equations which only need to compute the gradient of a function.
More informationCan irrational tilings give Catalan numbers?
Can irrational tilings give Catalan numbers? Igor Pak, UCLA (joint work with Scott Garrabrant) Stanley s 70th Birthday Conference, MIT June 24, 2014 1 Biographical tidbit My best investment ever: 2.38
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 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 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 informationAn Explicit Formulation for Two Dimensional Vector Partition Functions
An Explicit Formulation for Two Dimensional Vector Partition Functions ZHIQIANG XU Abstract In this paper, an explicit formulation for two dimensional multivariate truncated power functions is presented,
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 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 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 informationPolytopes and Algebraic Geometry. Jesús A. De Loera University of California, Davis
Polytopes and Algebraic Geometry Jesús A. De Loera University of California, Davis Outline of the talk 1. Four classic results relating polytopes and algebraic geometry: (A) Toric Geometry (B) Viro s Theorem
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 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 informationHigher Hasse Witt matrices. Masha Vlasenko. June 1, 2016 UAM Poznań
Higher Hasse Witt matrices Masha Vlasenko June 1, 2016 UAM Poznań Motivation: zeta functions and periods X/F q smooth projective variety, q = p a zeta function of X: ( Z(X/F q ; T ) = exp m=1 #X(F q m)
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 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 informationStandard Young Tableaux Old and New
Standard Young Tableaux Old and New Ron Adin and Yuval Roichman Department of Mathematics Bar-Ilan University Workshop on Group Theory in Memory of David Chillag Technion, Haifa, Oct. 14 1 2 4 3 5 7 6
More informationABSTRACT NONSINGULAR CURVES
ABSTRACT NONSINGULAR CURVES Affine Varieties Notation. Let k be a field, such as the rational numbers Q or the complex numbers C. We call affine n-space the collection A n k of points P = a 1, a,..., a
More informationWhat can be expressed via Conic Quadratic and Semidefinite Programming?
What can be expressed via Conic Quadratic and Semidefinite Programming? A. Nemirovski Faculty of Industrial Engineering and Management Technion Israel Institute of Technology Abstract Tremendous recent
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 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 informationAnalogs of Hodge Riemann relations
Analogs of Hodge Riemann relations in algebraic geometry, convex geometry and linear algebra V. Timorin State University of New York at Stony Brook March 28, 2006 Hodge Riemann form Let X be a compact
More information47-831: Advanced Integer Programming Lecturer: Amitabh Basu Lecture 2 Date: 03/18/2010
47-831: Advanced Integer Programming Lecturer: Amitabh Basu Lecture Date: 03/18/010 We saw in the previous lecture that a lattice Λ can have many bases. In fact, if Λ is a lattice of a subspace L with
More informationAlgebraic Geometry and Convex Geometry. A. Khovanskii
Algebraic Geometry and Convex Geometry A. Khovanskii 1 Intersection index on an irreducible variety X, dim X = n Let K(X) be the semigroup of spaces L of rational functions on X such that: a) dim L
More informationInteger Programming Duality
Integer Programming Duality M. Guzelsoy T. K. Ralphs July, 2010 1 Introduction This article describes what is known about duality for integer programs. It is perhaps surprising that many of the results
More informationMathematics 530. Practice Problems. n + 1 }
Department of Mathematical Sciences University of Delaware Prof. T. Angell October 19, 2015 Mathematics 530 Practice Problems 1. Recall that an indifference relation on a partially ordered set is defined
More informationAlgebraic and Geometric ideas in the theory of Discrete Optimization
Algebraic and Geometric ideas in the theory of Discrete Optimization Jesús A. De Loera, UC Davis Three Lectures based on the book: Algebraic & Geometric Ideas in the Theory of Discrete Optimization (SIAM-MOS
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 informationarxiv:math/ v1 [math.co] 25 May 2004
ALGEBRAIC COMBINATORICS OF MAGIC SQUARES By arxiv:math/007v [math.co] May 00 MAYA AHMED B.Sc. (Bombay University) 988 M.Sc. (IIT, Bombay) 99 M.S. (University of Washington) 997 DISSERTATION Submitted in
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 informationIn particular, if A is a square matrix and λ is one of its eigenvalues, then we can find a non-zero column vector X with
Appendix: Matrix Estimates and the Perron-Frobenius Theorem. This Appendix will first present some well known estimates. For any m n matrix A = [a ij ] over the real or complex numbers, it will be convenient
More informationON THE NUMBER OF INTEGER POINTS IN TRANSLATED AND EXPANDED POLYHEDRA
ON THE NUMBER OF INTEGER POINTS IN TRANSLATED AND EXPANDED POLYHEDRA DANNY NGUYEN AND IGOR PAK Abstract. We prove that the problem of minimizing the number of integer points in parallel translations of
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 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 informationSome Catalan Musings p. 1. Some Catalan Musings. Richard P. Stanley
Some Catalan Musings p. 1 Some Catalan Musings Richard P. Stanley Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,... Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,...
More informationIs Analysis Necessary?
Is Analysis Necessary? Ira M. Gessel Brandeis University Waltham, MA gessel@brandeis.edu Special Session on Algebraic and Analytic Combinatorics AMS Fall Eastern Meeting University of Connecticut, Storrs
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 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 information