Computing Regions (in a Hyperplane Arrangment) with Zaslavsky' s Theorem

This notebook was written by Nathan Williams. It is a very quick implementation of Zaslavasky’s Theorem.

Usage. Type ComputeRegions[a list of equations defining hyperplanes in the n variables x1,....,xn , n].

Example. The Braid arrangement in has *n**!* regions.

In[3173]:=

Out[3173]=

Example. The Linial arrangement in has regions.

Example. The Shi arrangement in has regions.

Example. The Catalan arrangement in has regions.

Code

In[3174]:=