Freeness of hyperplane arrangements between Boolean arrangements and Weyl arrangements of type B_

DOI10.37236/9341MaRDI QIDQ783056zbMATH OpenOpenAlexFDO

Authors Michele Torielli, Shuhei Tsujie

Publication date 30 July 2020

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

freenesshyperplane arrangementssigned graphsWeyl arrangements

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Derivations and commutative rings (13N15) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Relations with arrangements of hyperplanes (32S22) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Abstract: Every subarrangement of Weyl arrangements of type $B_{ell}$ is represented by a signed graph. Edelman and Reiner characterized freeness of subarrangements between type $A_{ell-1}$ and type $B_{ell}$ in terms of graphs. Recently, Suyama and the authors characterized freeness for subarrangements containing Boolean arrangements satisfying a certain condition. This article is a sequel to the previous work. Namely, we give a complete characterization for freeness of arrangements between Boolean arrangements and Weyl arrangements of type $B_{ell}$ in terms of graphs.

Recommendations

• Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\)
• Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
• Signed-eliminable graphs and free multiplicities on the braid arrangement
• Divisionally free arrangements of hyperplanes
• Freeness of arrangements between the Weyl arrangements of types ${A_{n - 1}}$ and ${B_n}$

Cites work

• An introduction to hyperplane arrangements
• Divisionally free arrangements of hyperplanes
• Free arrangements of hyperplanes and supersolvable lattices
• Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
• Generalized exponents of a free arrangement of hyperplanes and Shepherd- Todd-Brieskorn formula
• scientific article; zbMATH DE number 3781584 (Why is no real title available?)
• scientific article; zbMATH DE number 52944 (Why is no real title available?)
• Incidence matrices and interval graphs
• Modular Constructions for Combinatorial Geometries
• New characterizations of freeness for hyperplane arrangements
• Signed graphs
• Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\)
• Supersolvable lattices
• Trivially perfect graphs
• Vertex-weighted graphs and freeness of \psi -graphical arrangements

Cited in

(9)

• Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
• Vertex-weighted graphs and freeness of \psi -graphical arrangements
• On the Falk invariant of Shi and linial arrangements
• Modular construction of free hyperplane arrangements
• The Stability of the Family ofB₂-Type Arrangements
• Signed-eliminable graphs and free multiplicities on the braid arrangement
• Freeness of arrangements between the Weyl arrangements of types ${A_{n - 1}}$ and ${B_n}$
• Freeness for restriction arrangements of the extended Shi and Catalan arrangements
• MAT-free graphic arrangements and a characterization of strongly chordal graphs by edge-labeling

This page was built for publication: Freeness of hyperplane arrangements between Boolean arrangements and Weyl arrangements of type \(B_{\ell}\)

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