Free paths of arrangements of hyperplanes
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 A and A \H,L\ are free, then at least one of two among them is free. When A is in the three dimensional arrangement, we show a stronger statement.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.