arXiv (All)
open access
Nice Partitions, Supersolvability, and Freeness in Deformations of Graphic Arrangements
We study affine deformations $\mathcal{A}(G_{\mathcal{S}})$ of graphic arrangements and their cones. Here $G=([n],E(G))$ is a simple graph, $\mathcal{S}=(S_{ij})$ is a family of finite gain sets, and $\mathcal{A}(G_{\mathcal{S}})$ consists of the hyperplanes $x_i-x_j=a$ with $a\in S_{ij}$. We call $
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
- Results in lattices, ortholattices, and graphs#957961
- A square-root law for equitable coloring#1051534
- Constructions for positional games and applications to domination games / Ali Deniz Bagdas, Dennis Clemens, Fabian Hamann, Yannick Mogge#921993
- Exact volume computation for Boolean quadric polytopes of series-parallel graphs#1155669
- Minimal Resolving Sets in Rectangular Grid Graphs: A Complete Characterization and Enumeration#1130738
Record · ID 1144374
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