Arcs on Punctured Disks Intersecting at Most Twice with Endpoints on the Boundary
classification
🧮 math.GT
keywords
arcsintersectingtwiceboundarydiskpuncturedsimplebinom
read the original abstract
Let $D_n$ be the $n$-punctured disk. We prove that a family of essential simple arcs starting and ending at the boundary and pairwise intersecting at most twice is of size at most $\binom{n+1}{3}$. On the way, we also show that any nontrivial square complex homeomorphic to a disk whose hyperplanes are simple arcs intersecting at most twice must have a corner or a spur.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.