Freeness of hyperplane arrangements between boolean arrangements and weyl arrangements of type B

Michele Torielli, Shuhei Tsujie

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

Every subarrangement of Weyl arrangements of type B is represented by a signed graph. Edelman and Reiner characterized freeness of subarrangements between type Aℓ−1 and type B 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 in terms of graphs.

Original languageEnglish (US)
Article numberP3.10
Pages (from-to)1-15
Number of pages15
JournalElectronic Journal of Combinatorics
Volume27
Issue number3
DOIs
StatePublished - 2020
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Freeness of hyperplane arrangements between boolean arrangements and weyl arrangements of type B'. Together they form a unique fingerprint.

Cite this