Skip to content
DraconiticResearch
Search Sources API
181,716 studies31 sourcesUpdated 21 min ago
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

  1. Topological line arrangements with high multiplicities
    Paolo Aceto, Marco Golla
    HALPreprintLicence not statedGeometry & topologyHAL
  2. A generalized Saito criterion, from line arrangements to curves
    Anca Măcinic
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  3. Line arrangements, bounded cells, and discrepancy
    Imre Bárány
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. A generalized Terao Conjecture for line arrangements
    Alexandru Dimca, Piotr Pokora
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  5. On Guarding Line Arrangements
    Valentin Brimkov
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
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  -