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

Michele Torielli; Shuhei Tsujie

doi:10.37236/9341

Freeness of hyperplane arrangements between boolean arrangements and weyl arrangements of type B_ℓ

Michele Torielli, Shuhei Tsujie

Research output: Contribution to journal › Article › peer-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 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	https://doi.org/10.37236/9341
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

Access to Document

10.37236/9341

Cite this

@article{86571ec52cc8436e9daf975d5a88fe04,

title = "Freeness of hyperplane arrangements between boolean arrangements and weyl arrangements of type Bℓ",

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.",

author = "Michele Torielli and Shuhei Tsujie",

note = "Publisher Copyright: {\textcopyright} The authors.",

year = "2020",

doi = "10.37236/9341",

language = "English (US)",

volume = "27",

pages = "1--15",

journal = "Electronic Journal of Combinatorics",

issn = "1079-6061",

publisher = "Electronic Journal of Combinatorics",

number = "3",

}

TY - JOUR

T1 - Freeness of hyperplane arrangements between boolean arrangements and weyl arrangements of type Bℓ

AU - Torielli, Michele

AU - Tsujie, Shuhei

N1 - Publisher Copyright: © The authors.

PY - 2020

Y1 - 2020

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85088569200

UR - https://www.scopus.com/inward/citedby.url?scp=85088569200&partnerID=8YFLogxK

U2 - 10.37236/9341

DO - 10.37236/9341

M3 - Article

AN - SCOPUS:85088569200

SN - 1079-6061

VL - 27

SP - 1

EP - 15

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 3

M1 - P3.10

ER -

Freeness of hyperplane arrangements between boolean arrangements and weyl arrangements of type B_ℓ

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this