Polyhedral complex

From HandWiki
Short description: Math concept

In mathematics, a polyhedral complex is a set of polyhedra in a real vector space that fit together in a specific way.[1] Polyhedral complexes generalize simplicial complexes and arise in various areas of polyhedral geometry, such as tropical geometry, splines and hyperplane arrangements.

Definition

A polyhedral complex [math]\displaystyle{ \mathcal{K} }[/math] is a set of polyhedra that satisfies the following conditions:

1. Every face of a polyhedron from [math]\displaystyle{ \mathcal{K} }[/math] is also in [math]\displaystyle{ \mathcal{K} }[/math].
2. The intersection of any two polyhedra [math]\displaystyle{ \sigma_1, \sigma_2 \in \mathcal{K} }[/math] is a face of both [math]\displaystyle{ \sigma_1 }[/math] and [math]\displaystyle{ \sigma_2 }[/math].

Note that the empty set is a face of every polyhedron, and so the intersection of two polyhedra in [math]\displaystyle{ \mathcal{K} }[/math] may be empty.

Examples

Fans

A fan is a polyhedral complex in which every polyhedron is a cone from the origin. Examples of fans include:

References

  1. Ziegler, Günter M. (1995), Lectures on Polytopes, Graduate Texts in Mathematics, 152, Berlin, New York: Springer-Verlag 
  2. Maclagan, Diane; Sturmfels, Bernd (2015). Introduction to Tropical Geometry. American Mathematical Soc.. ISBN 9780821851982. 
  3. Mora, Teo; Robbiano, Lorenzo (1988). "The Gröbner fan of an ideal" (in en). Journal of Symbolic Computation 6 (2–3): 183–208. doi:10.1016/S0747-7171(88)80042-7. 
  4. Bayer, David; Morrison, Ian (1988). "Standard bases and geometric invariant theory I. Initial ideals and state polytopes" (in en). Journal of Symbolic Computation 6 (2–3): 209–217. doi:10.1016/S0747-7171(88)80043-9.