<--- Back to Details
First PageDocument Content
Polytopes / Polynomials / Lattice points / Polyhedral combinatorics / Simplex / Topology / Convex polytope / Vector space / Ehrhart polynomial / Algebra / Mathematics / Geometry
Date: 2012-07-04 05:35:00
Polytopes
Polynomials
Lattice points
Polyhedral combinatorics
Simplex
Topology
Convex polytope
Vector space
Ehrhart polynomial
Algebra
Mathematics
Geometry

Add to Reading List

Source URL: www.math.nagoya-u.ac.jp

Download Document from Source Website

File Size: 260,57 KB

Share Document on Facebook

Similar Documents

SOME PROBLEMS MOTIVATED BY THE NOTION OF THRESHOLD GRAPHS MURALI K. SRINIVASAN Abstract. We motivate and discuss four open problems in polyhedral combinatorics related to threshold graphs, degree sequences of graphs and

DocID: 1uO9A - View Document

POLYMATROID SUBDIVISION ALEX FINK These notes are a draft exposition, written for a portion of Jack Edmonds’ minicourse Existential Polytime and Polyhedral Combinatorics at the London Taught Course Center in June 2015.

DocID: 1uCMM - View Document

181 Documenta Math. Edmonds, Matching and the Birth of Polyhedral Combinatorics

DocID: 1s9cj - View Document

Geometry / Mathematics / Space / Convex geometry / Linear programming / Operations research / Polytopes / Polyhedral combinatorics / Hirsch conjecture / KleeMinty cube / Simplex algorithm / Convex polytope

75 Documenta Math. Who Solved the Hirsch Conjecture? ¨ nter M. Ziegler

DocID: 1rnGl - View Document

Graph theory / Mathematics / Discrete mathematics / Graph / Analytic combinatorics / Polyhedral graph

Combinatorial graph theory and connectivity Keith Briggs more.btexact.com/people/briggsk2/cgt.html Mathematics of Networks 2004 July

DocID: 1qy0E - View Document