arXiv (All)
open access
The opposite of admissibility for local systems on line arrangements
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Process as Structure: A Clarification of Interaction Beyond Counting#95340
- Audited Operational Realisability: Canonical Inference Closure and Evidence-Preserving Composition#1160385
- Reachability, Not Observation: Containing Systems Whose Wiring Changes#1014308
- Reachability, Not Observation: Containing Systems Whose Wiring Changes#978367
- Amenable graphs and the spectral radius of extensions of Markov maps#1077817
Record · ID 1142399
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive