Coarsening polyhedral complexes

From MaRDI portal
Publication:2845876

DOI10.1090/S0002-9939-2012-11194-3zbMATH Open1275.52014arXiv1004.4194MaRDI QIDQ2845876FDOQ2845876


Authors: Nathan Reading Edit this on Wikidata


Publication date: 3 September 2013

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Abstract: Given a polyhedral complex C with convex support, we characterize, by a local codimension-2 condition, polyhedral complexes that coarsen C. The proof of the characterization draws upon a surprising general shortcut for showing that a collection of polyhedra is a polyhedral complex and upon a property of hyperplane arrangements which is equivalent, for Coxeter arrangements, to Tits' solution to the Word Problem. The motivating special case, the case where C is a complete fan, generalizes a result of Morton, Pachter, Shiu, Sturmfels, and Wienand that equates convex rank tests with semigraphoids. The proof of the main result also implies a special case of Tietze's convexity theorem. We also prove oriented matroid versions of our results, obtaining, as a byproduct, an oriented matroid version of Tietze's convexity theorem.


Full work available at URL: https://arxiv.org/abs/1004.4194




Recommendations



Cites Work


Cited In (1)





This page was built for publication: Coarsening polyhedral complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845876)