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 , so called connected subgraph arrangements . 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 is an aspherical connected subgraph arrangement, then is free with the unique possible exception when the underlying graph is the complete graph on $4$ nodes.
Paper Prompts
Sign up for free to create and run prompts on this paper.