[图书][B] Undergraduate Texts in Mathematics

S Axler, KA Ribet - 2015 - Springer
In Chapter 1, we have seen how the algebra of the polynomial rings k [x1,..., xn] and the
geometry of affine algebraic varieties are linked. In this chapter, we will study the method of …

[图书][B] Computing the continuous discretely: Integer-point enumeration in polyhedra

M Beck, S Robins - 2007 - Springer
The world is continuous, but the mind is discrete. David Mumford We seek to bridge some
critical gaps between various? elds of mathematics by studying the interplay between the …

Probability calculations under the IAC hypothesis

MC Wilson, G Pritchard - Mathematical Social Sciences, 2007 - Elsevier
Probability calculations under the IAC hypothesis - ScienceDirect Skip to main contentSkip to
article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

Rational Ehrhart quasi-polynomials

E Linke - Journal of Combinatorial Theory, Series A, 2011 - Elsevier
Ehrhartʼs famous theorem states that the number of integral points in a rational polytope is
a quasi-polynomial in the integral dilation factor. We study the case of rational dilation …

Geometric complexity theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry

KD Mulmuley - arXiv preprint arXiv:0704.0229, 2007 - arxiv.org
This article belongs to a series on geometric complexity theory (GCT), an approach to the P
vs. NP and related problems through algebraic geometry and representation theory. The …

Ehrhart functions and symplectic embeddings of ellipsoids

D Cristofaro‐Gardiner… - Journal of the London …, 2020 - Wiley Online Library
McDuff has previously shown that one four‐dimensional symplectic ellipsoid can be
symplectically embedded into another if and only if a certain combinatorial criteria holds. We …

[PDF][PDF] barvinok: User guide

S Verdoolaege - … available at http://www. kotnet. org …, 2007 - compsys-tools.ens-lyon.fr
barvinok: User Guide Page 1 barvinok: User Guide Version: barvinok-0.39 Sven
Verdoolaege January 15, 2016 Contents Contents 1 1 isl interface 5 1.1 Library …

[PDF][PDF] The complexity of generating functions for integer points in polyhedra and beyond

A Barvinok - International Congress of Mathematicians, 2006 - Citeseer
Motivated by the formula for the sum of the geometric series, we consider various classes of
sets S⊂ Zd of integer points for which an a priori “long” Laurent series or polynomial∑ m∈ …

Computing the continuous discretely

M Beck, S Robins - 2020 - Springer
Undergraduate Texts in Mathematics are generally aimed at third-and fourthyear
undergraduate mathematics students at North American universities. These texts strive to …

Irrational triangles with polynomial Ehrhart functions

D Cristofaro-Gardiner, TX Li, RP Stanley - Discrete & Computational …, 2019 - Springer
While much research has been done on the Ehrhart functions of integral and rational
polytopes, little is known in the irrational case. In our main theorem, we determine exactly …