DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Integral polytope
Integral polytope
7 LATTICE POINTS and LATTICE POLYTOPES Alexander Barvinok
Combinatorial and Discrete Problems in Convex Geometry
Classification of Ehrhart Polynomials of Integral Simplices Akihiro Higashitani
Unimodular Triangulations of Dilated 3-Polytopes
The $ H^* $-Polynomial of the Order Polytope of the Zig-Zag Poset
Triangulations of Integral Polytopes, Examples and Problems
Arxiv:1904.05974V3 [Cs.DS] 11 Jul 2019
LMS Undergraduate Summer School 2016 the Many Faces of Polyhedra
Berline-Vergne Valuation and Generalized Permutohedra
Forbidden Vertices
Ehrhart Positivity
The Order Polytope of Young's Lattice
Basic Polyhedral Theory 3
Arxiv:2107.07326V1 [Math.CO]
Arxiv:2004.09377V1 [Math.CA] 16 Apr 2020 Sapolygon, a Is Angle If Ω Ihitgrcodnts If Coordinates, Integer with N19 Yg Ik If Pick: G
Uwaterloo Latex Thesis Template
A Vertex and Hyperplane Descriptions of Polytopes
Volumes and Integrals Over Polytopes
Top View
Combinatorial Invariants of Rational Polytopes
Cutting Planes and Integrality of Polyhedra: Structure and Complexity
The Maximum-Weight Stable Matching Problem: Duality and Efficiency
Largest Integral Simplices with One Interior Integral Point: Solution Of
Computing the Ehrhart Polynomial of a Convex Lattice Polytope*
Computing the Volume, Counting Integral Points, and Exponential Sums*
Integer Decomposition Property of Dilated Polytopes
The Diameter of the Fractional Matching Polytope and Its Hardness Implications
Classification of Ehrhart Polynomials of Integral Simplices
Diameter of Polytopes: Algorithmic and Combinatorial Aspects
Arxiv:Math/0012099V1 [Math.CO] 12 Dec 2000 Oiloemyascaewt T Nawyw Hl Ul Expla Fully Shall We Way a in It, with Associate May Mu One a Nomial Given Polytopes
At Play with Combinatorial Optimization, Integer Programming and Polyhedra Gautier Stauffer
Integer-Empty Polytopes in the 0/1-Cube with Maximal Gomory–Chvátal Rank
A Convex Geometric Approach to Counting the Roots of a Polynomial System
An Algorithmic Theory of Lattice Points in Polyhedra
Polyhedral Problems in Combinatorial Convex Geometry
16 SUBDIVISIONS and TRIANGULATIONS of POLYTOPES Carl W
Structure in Stable Matching Problems
Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs˚
Ehrhart Polynomials of Cyclic Polytopes
Lecture Notes on Lattice Polytopes (Preliminary Version of December 7, 2012)
A Generalization the Ehrhart Polynomial for Simplices Dilated by Polynomials
Arxiv:1711.09962V2 [Math.CO] 31 Aug 2018 O Nyapasi Obntra Rbes Tas Per,Frinst for 75]
Cutting Polytopes
On Flow Polytopes, Order Polytopes, and Certain Faces of the Alternating Sign Matrix Polytope
A Gallery of Discrete Volumes
Integral Representation Formulas Associated with Toric Varieties Alexey Shchuplev
Order-Chain Polytopes∗
12, 24 and Beyond
Decomposition of Polytopes and Polynomials?
A NOTE on LATTICE-FACE POLYTOPES and THEIR EHRHART POLYNOMIALS 1. Introduction a Convex Polytope Is a Convex Hull of a Finite Se
Toric Varieties and Residues
Diameter of Polytopes: Algorithmic and Combinatorial Aspects
Newton Polytopes and Numerical Algebraic Geometry
Ehrhart Polynomials of Lattice-Face Polytopes 1