Pith. sign in

REVIEW

Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs

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 2007.01248 v1 pith:TLRDDAVV submitted 2020-07-02 math.CO

Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs

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

The class of Worpitzky-compatible subarrangements of a Weyl arrangement together with an associated Eulerian polynomial was recently introduced by Ashraf, Yoshinaga and the first author, which brings the characteristic and Ehrhart quasi-polynomials into one formula. The subarrangements of the braid arrangement, the Weyl arrangement of type $A$, are known as the graphic arrangements. We prove that the Worpitzky-compatible graphic arrangements are characterized by cocomparability graphs. Our main result yields new formulas for the chromatic and graphic Eulerian polynomials of cocomparability graphs.

discussion (0)

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