Discrete structures in geometry and topology

From MaRDI portal





The paper considers the problem of partitioning the \(d\)-dimensional Euclidean space into sub-regions by means of a given finite set of hyperplanes, and counting the number of resulting regions. The main algebraic tools used are Poincaré polynomials and the Möbius function.NEWLINENEWLINEFor the entire collection see [Zbl 1222.00035].











This page was built for publication: Discrete structures in geometry and topology

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