Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs

DOI10.5802/CRMATH.210zbMATH Open1472.52037arXiv2007.01248OpenAlexW3195365435MaRDI QIDQ1979871FDOQ1979871

Authors: Tan Nhat Tran, Akiyoshi Tsuchiya 

Publication date: 3 September 2021

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2007.01248

Recommendations

• Eulerian polynomials for subarrangements of Weyl arrangements
• Worpitzky partitions for root systems and characteristic quasi-polynomials
• Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\)
• Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
• Characteristic and Ehrhart polynomials

zbMATH Keywords

Weyl arrangementsarrangements of hyperplanesfree arrangementsroot system

Mathematics Subject Classification ID

Graph polynomials (05C31) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Root systems (17B22)

Cites Work

• Title not available (Why is that?)
• Modular decomposition and transitive orientation
• Optimal greedy algorithms for indifference graphs
• Domination on Cocomparability Graphs
• Expansions of Chromatic Polynomials and Log-Concavity
• Free arrangements of hyperplanes and supersolvable lattices
• On the cover polynomial of a digraph
• Supersolvable lattices
• Title not available (Why is that?)
• Transitiv orientierbare Graphen
• A Characterization of Comparability Graphs and of Interval Graphs
• The freeness of ideal subarrangements of Weyl arrangements
• Title not available (Why is that?)
• Alcoves Corresponding to an Affine Weyl Group
• Eulerian Numbers
• An optimal greedy heuristic to color interval graphs
• On a refinement of the generalized Catalan numbers for Weyl groups
• The topology of the coloring complex
• The coloring ideal and coloring complex of a graph
• Basic derivations for subarrangements of Coxeter arrangements
• On floors and ceilings of the \(k\)-Catalan arrangement
• Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
• Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\)
• Worpitzky partitions for root systems and characteristic quasi-polynomials
• Eulerian polynomials for subarrangements of Weyl arrangements

Cited In (2)

• Logarithmic vector fields and freeness of divisors and arrangements: new perspectives and applications. Abstracts from the workshop held January 24--30, 2021 (online meeting)
• MAT-free graphic arrangements and a characterization of strongly chordal graphs by edge-labeling

This page was built for publication: Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979871)