Signed-eliminable graphs and free multiplicities on the braid arrangement
classification
🧮 math.AC
math.AGmath.CO
keywords
graphsarrangementbraidfreemultiplicitiesclassificationfreenessgeneralization
read the original abstract
We define specific multiplicities on the braid arrangement by using edge-bicolored graphs. To consider their freeness, we introduce the notion of bicolor-eliminable graphs as a generalization of Stanley's classification theory of free graphic arrangements by chordal graphs. This generalization gives us a complete classification of the free multiplicities defined above. As an application, we prove one direction of a conjecture of Athanasiadis on the characterization of the freeness of the deformation of the braid arrangement in terms of directed graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.