[图书][B] Monomial algebras

RH Villarreal - 2001 - api.taylorfrancis.com
The main purpose of this book is to introduce algebraic, combinatorial, and computational
methods to study monomial algebras and their presentation ideals, including Stanley …

[图书][B] Triangulations: structures for algorithms and applications

J De Loera, J Rambau, F Santos - 2010 - books.google.com
Triangulations presents the first comprehensive treatment of the theory of secondary
polytopes and related topics. The text discusses the geometric structure behind the …

[图书][B] Polytopes, rings, and K-theory

W Bruns, J Gubeladze - 2009 - books.google.com
Page 1 WINFRIED BRUNS JOSEPH GUBELADZE Polytopes, Rings, and K-Theory Springer
Springer Monographs in Mathematics Page 2 Springer Monographs in Mathematics For further …

Subdivisions and triangulations of polytopes

CW Lee, F Santos - Handbook of discrete and computational …, 2017 - taylorfrancis.com
We are interested in the set of all subdivisions or triangulations of a given polytope P and
with a fixed finite set V of points that can be used as vertices. V must contain the vertices of …

Unimodality questions for integrally closed lattice polytopes

J Schepers, L Van Langenhoven - Annals of Combinatorics, 2013 - Springer
It is a famous open question whether every integrally closed reflexive polytope has a
unimodal Ehrhart δ-vector. We generalize this question to arbitrary integrally closed lattice …

[图书][B] Existence of unimodular triangulations—positive results

C Haase, A Paffenholz, L Piechnik, F Santos - 2021 - ams.org
AMS eBooks: Memoirs of the American Mathematical Society Skip to Main Content
American Mathematical Society American Mathematical Society MathSciNet Bookstore …

[HTML][HTML] The integrality number of an integer program

J Paat, M Schlöter, R Weismantel - Mathematical Programming, 2022 - Springer
We introduce the integrality number of an integer program (IP). Roughly speaking, the
integrality number is the smallest number of integer constraints needed to solve an IP via a …

Improving proximity bounds using sparsity

J Lee, J Paat, I Stallknecht, L Xu - … ISCO 2020, Montreal, QC, Canada, May …, 2020 - Springer
We refer to the distance between optimal solutions of integer programs and their linear
relaxations as proximity. In 2018 Eisenbrand and Weismantel proved that proximity is …

Problems and algorithms for affine semigroups

W Bruns, J Gubeladze, NV Trung - arXiv preprint math/0101116, 2001 - arxiv.org
In this article we overview those aspects of the theory of affine semigroups and their
algebras that have been relevant for our own research, and pose several open problems …

The distributions of functions related to parametric integer optimization

T Oertel, J Paat, R Weismantel - SIAM Journal on Applied Algebra and …, 2020 - SIAM
We consider the asymptotic distribution of the integer program (IP) sparsity function, which
measures the minimal support of optimal IP solutions, and the IP to linear program (LP) …