Free paths of arrangements of hyperplanes
From MaRDI portal
Abstract: We study the free path problem, i.e., if we are given two free arrangements of hyperplanes, then we can connect them by free arrangements or not. We prove that if an arrangement and are free, then at least one of two among them is free. When is in the three dimensional arrangement, we show a stronger statement.
This page was built for publication: Free paths of arrangements of hyperplanes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6440822)