Papers
Topics
Authors
Recent
Search
2000 character limit reached

On connected subgraph arrangements

Published 25 Feb 2025 in math.CO and math.AT | (2502.18144v1)

Abstract: Recently, Cuntz and K\"uhne introduced a particular class of hyperplane arrangements stemming from a given graph GG, so called connected subgraph arrangements AGA_G. In this note we strengthen some of the result from their work and prove new ones for members of this class. For instance, we show that aspherical members withing this class stem from a rather restricted set of graphs. Specifically, if AGA_G is an aspherical connected subgraph arrangement, then AGA_G is free with the unique possible exception when the underlying graph GG is the complete graph on $4$ nodes.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.