Freeness of Hyperplane Arrangements between Boolean Arrangements and Weyl Arrangements of Type B-l
| Autor: | Shuhei Tsujie, Michele Torielli |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
Applied Mathematics
0102 computer and information sciences Type (model theory) Characterization (mathematics) 52C35 32S22 05C22 20F55 13N15 01 natural sciences Theoretical Computer Science Combinatorics Computational Theory and Mathematics Hyperplane 010201 computation theory & mathematics FOS: Mathematics Mathematics - Combinatorics Discrete Mathematics and Combinatorics Geometry and Topology Combinatorics (math.CO) Signed graph Mathematics |
| Zdroj: | Electronic journal of combinatorics. 27(3):P3 |
| ISSN: | 1077-8926 |
| Popis: | 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. Comment: 15 pages |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|