Metraipolis › archive › dc_df45df054cbf

The opposite of admissibility for local systems on line arrangements — arXiv:2609.38103

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.38103
License (as archived)
CC0-1.0
Archived
2026-10-07T18:34:01.904Z
SHA-256 of the archived text
5e46349ac967d1f718eb2bf2908582f9232e26fe361fd92f6c2cfc4cb535abec
Stable URL of this page
https://metraipolis.com/documento/dc_df45df054cbf

How to cite

The opposite of admissibility for local systems on line arrangements — arXiv:2609.38103 — arXiv (en), https://arxiv.org/abs/2609.38103 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_df45df054cbf (Metraipolis archive dc_df45df054cbf, sha256 5e46349ac967d1f718eb2bf2908582f9232e26fe361fd92f6c2cfc4cb535abec)
BibTeX
@misc{dcdf45df054cbf,
  title = {The opposite of admissibility for local systems on line arrangements — arXiv:2609.38103},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.38103},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_df45df054cbf; sha256 5e46349ac967d1f718eb2bf2908582f9232e26fe361fd92f6c2cfc4cb535abec},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38103. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in math.CO).
Categorie arXiv: Algebraic Geometry (math.AG) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.38103 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T17:59:19.297Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).