Arrangements of ideal type are inductively free

Research output: Contribution to journalArticleResearchpeer review

Authors

External Research Organisations

  • Ruhr-Universität Bochum
View graph of relations

Details

Original languageEnglish
Pages (from-to)761-773
Number of pages13
JournalInternational Journal of Algebra and Computation
Volume29
Issue number5
Publication statusPublished - Aug 2019

Abstract

Extending earlier work by Sommers and Tymoczko, in 2016, Abe, Barakat, Cuntz, Hoge, and Terao established that each arrangement of ideal type stemming from an ideal in the set of positive roots of a reduced root system is free. Recently, Röhrle showed that a large class of the satisfy the stronger property of inductive freeness and conjectured that this property holds for all In this paper, we confirm this conjecture.

Keywords

    arrangement of ideal type, free arrangement, inductively free arrangement, Root system, Weyl arrangement, Weyl groupoid

ASJC Scopus subject areas

Cite this

Arrangements of ideal type are inductively free. / Cuntz, Michael; Röhrle, Gerhard; Schauenburg, Anne.
In: International Journal of Algebra and Computation, Vol. 29, No. 5, 08.2019, p. 761-773.

Research output: Contribution to journalArticleResearchpeer review

Cuntz M, Röhrle G, Schauenburg A. Arrangements of ideal type are inductively free. International Journal of Algebra and Computation. 2019 Aug;29(5):761-773. doi: 10.48550/arXiv.1711.09760, 10.1142/S0218196719500267
Cuntz, Michael ; Röhrle, Gerhard ; Schauenburg, Anne. / Arrangements of ideal type are inductively free. In: International Journal of Algebra and Computation. 2019 ; Vol. 29, No. 5. pp. 761-773.
Download
@article{d7ad9ae5bc47400ab047886738577c2a,
title = "Arrangements of ideal type are inductively free",
abstract = "Extending earlier work by Sommers and Tymoczko, in 2016, Abe, Barakat, Cuntz, Hoge, and Terao established that each arrangement of ideal type stemming from an ideal in the set of positive roots of a reduced root system is free. Recently, R{\"o}hrle showed that a large class of the satisfy the stronger property of inductive freeness and conjectured that this property holds for all In this paper, we confirm this conjecture.",
keywords = "arrangement of ideal type, free arrangement, inductively free arrangement, Root system, Weyl arrangement, Weyl groupoid",
author = "Michael Cuntz and Gerhard R{\"o}hrle and Anne Schauenburg",
note = "Funding information: This work was supported by DFG-Grant RO 1072/16-1.",
year = "2019",
month = aug,
doi = "10.48550/arXiv.1711.09760",
language = "English",
volume = "29",
pages = "761--773",
journal = "International Journal of Algebra and Computation",
issn = "0218-1967",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "5",

}

Download

TY - JOUR

T1 - Arrangements of ideal type are inductively free

AU - Cuntz, Michael

AU - Röhrle, Gerhard

AU - Schauenburg, Anne

N1 - Funding information: This work was supported by DFG-Grant RO 1072/16-1.

PY - 2019/8

Y1 - 2019/8

N2 - Extending earlier work by Sommers and Tymoczko, in 2016, Abe, Barakat, Cuntz, Hoge, and Terao established that each arrangement of ideal type stemming from an ideal in the set of positive roots of a reduced root system is free. Recently, Röhrle showed that a large class of the satisfy the stronger property of inductive freeness and conjectured that this property holds for all In this paper, we confirm this conjecture.

AB - Extending earlier work by Sommers and Tymoczko, in 2016, Abe, Barakat, Cuntz, Hoge, and Terao established that each arrangement of ideal type stemming from an ideal in the set of positive roots of a reduced root system is free. Recently, Röhrle showed that a large class of the satisfy the stronger property of inductive freeness and conjectured that this property holds for all In this paper, we confirm this conjecture.

KW - arrangement of ideal type

KW - free arrangement

KW - inductively free arrangement

KW - Root system

KW - Weyl arrangement

KW - Weyl groupoid

UR - http://www.scopus.com/inward/record.url?scp=85061512166&partnerID=8YFLogxK

U2 - 10.48550/arXiv.1711.09760

DO - 10.48550/arXiv.1711.09760

M3 - Article

AN - SCOPUS:85061512166

VL - 29

SP - 761

EP - 773

JO - International Journal of Algebra and Computation

JF - International Journal of Algebra and Computation

SN - 0218-1967

IS - 5

ER -

By the same author(s)