Vertex-weighted graphs and freeness of $ \psi $-graphical arrangements
DOI10.1007/s00454-018-9984-1zbMath1412.52016arXiv1511.04853OpenAlexW3106100763MaRDI QIDQ1739204
Publication date: 25 April 2019
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.04853
chordal graphsupersolvable arrangementhyperplane arrangementCoxeter arrangementfree arrangementIsh arrangementgraphical arrangementmultiarrangementvertex-weighted graph
Reflection and Coxeter groups (group-theoretic aspects) (20F55) Relations with arrangements of hyperplanes (32S22) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Derivations and commutative rings (13N15) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The freeness of Ish arrangements
- Generalized splines and graphic arrangements
- Characterization of a free arrangement and conjecture of Edelman and Reiner
- On rigid circuit graphs
- Free arrangements of hyperplanes and supersolvable lattices
- Free arrangements of hyperplanes over an arbitrary field
- Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
- Multiderivations of Coxeter arrangements
- Combinatorial construction of logarithmic differential forms
- Valid orderings of real hyperplane arrangements
- Supersolvability and freeness for \(\psi\)-graphical arrangements
- Incidence matrices and interval graphs
- Supersolvable lattices
- Matroid Representations and free Arrangements
- Signed-eliminable graphs and free multiplicities on the braid arrangement
This page was built for publication: Vertex-weighted graphs and freeness of $ \psi $-graphical arrangements