arXiv Analytics

Sign in

arXiv:1912.12449 [math.CO]AbstractReferencesReviewsResources

Geometry of Matroids and Hyperplane Arrangements

Jaeho Shin

Published 2019-12-28Version 1

There is a trichotomic relation between hyperplane arrangements, convex polytopes and matroids. We expand this theory while resolving the complexity issue expected by Mnev's universality theorem. In particular, we invent a combinatorial apparatus for the geometry of hyperplane arrangements in terms of semilattices and their operations, for instance, puzzle-pieces and the matroidal MMP. We also investigate matroid tilings and their extensions. As an algebro-geometric application, we answer Alexeev's question.

Related articles: Most relevant | Search more
arXiv:0911.4982 [math.CO] (Published 2009-11-25)
More bounds on the diameters of convex polytopes
arXiv:1111.1251 [math.CO] (Published 2011-11-04, updated 2013-09-23)
On a Generalization of Zaslavsky's Theorem for Hyperplane Arrangements
arXiv:1009.3676 [math.CO] (Published 2010-09-20)
On intersection lattices of hyperplane arrangements generated by generic points