Pith. sign in

REVIEW

MAT-free graphic arrangements and a characterization of strongly chordal graphs by edge-labeling

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2204.08878 v1 pith:VI4QE2PR submitted 2022-04-19 math.CO

MAT-free graphic arrangements and a characterization of strongly chordal graphs by edge-labeling

classification math.CO
keywords arrangementsgraphicsubarrangementschordalfreeidealmat-freeweyl
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Ideal subarrangements of a Weyl arrangement are proved to be free by the multiple addition theorem (MAT) due to Abe-Barakat-Cuntz-Hoge-Terao (2016). They form a significant class among Weyl subarrangements that are known to be free so far. The concept of MAT-free arrangements was introduced recently by Cuntz-M{\"u}cksch (2020) to capture a core of the MAT, which enlarges the ideal subarrangements from the perspective of freeness. The aim of this paper is to give a precise characterization of the MAT-freeness in the case of type $A$ Weyl subarrangements (or graphic arrangements). It is known that the ideal and free graphic arrangements correspond to the unit interval and chordal graphs respectively. We prove that a graphic arrangement is MAT-free if and only if the underlying graph is strongly chordal. In particular, it affirmatively answers a question of Cuntz-M{\"u}cksch that MAT-freeness is closed under taking localization in the case of graphic arrangements.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.