PreprintarXiv licencearXiv
The opposite of admissibility for local systems on line arrangements
Abstract
We study local systems on line arrangements for which no admissibility conditions are satisfied. In doing so we demonstrate the existence of these anti-admissible objects in both the finite and infinite setting and discuss their relation to the combinatorial data of arrangements. We also observe the connection between anti-admissibility and smooth branched coverings and how this connection is related to the branch set being minimal in one sense and maximal in another.
Related
BibTeX
@misc{harris2026opposite,
title = {{The opposite of admissibility for local systems on line arrangements}},
author = {Robert Harris},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.38103},
eprint = {2609.38103},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.38103},
}
RIS
TY - UNPB
TI - The opposite of admissibility for local systems on line arrangements
AU - Robert Harris
PY - 2026
DA - 2026/09/29
PB - arXiv
DO - 10.48550/arxiv.2609.38103
UR - https://arxiv.org/abs/2609.38103
AB - We study local systems on line arrangements for which no admissibility conditions are satisfied. In doing so we demonstrate the existence of these anti-admissible objects in both the finite and infinite setting and discuss their relation to the combinatorial data of arrangements. We also observe the connection between anti-admissibility and smooth branched coverings and how this connection is related to the branch set being minimal in one sense and maximal in another.
ER -