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 language | English (US) |
---|---|
Article number | P3.10 |
Pages (from-to) | 1-15 |
Number of pages | 15 |
Journal | Electronic Journal of Combinatorics |
Volume | 27 |
Issue number | 3 |
DOIs | |
State | Published - 2020 |
Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics