Free but not recursively free arrangements

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Seiten (von - bis)35-40
Seitenumfang6
FachzeitschriftProceedings of the American Mathematical Society
Jahrgang143
Ausgabenummer1
PublikationsstatusVeröffentlicht - 1 Jan. 2015

Abstract

We construct counterexamples to the conjecture that every free arrangement is recursively free in characteristic zero. The intersection lattice of our smallest example has a realization over a finite field which is recursively free, thus recursive freeness is not a combinatorial property of the intersection lattice of an arrangement.

ASJC Scopus Sachgebiete

Zitieren

Free but not recursively free arrangements. / Cuntz, M.; Hoge, T.
in: Proceedings of the American Mathematical Society, Jahrgang 143, Nr. 1, 01.01.2015, S. 35-40.

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Cuntz M, Hoge T. Free but not recursively free arrangements. Proceedings of the American Mathematical Society. 2015 Jan 1;143(1):35-40. doi: 10.1090/s0002-9939-2014-12263-5
Download
@article{703c9f8c4e0b4578846ac0d22c4c43af,
title = "Free but not recursively free arrangements",
abstract = "We construct counterexamples to the conjecture that every free arrangement is recursively free in characteristic zero. The intersection lattice of our smallest example has a realization over a finite field which is recursively free, thus recursive freeness is not a combinatorial property of the intersection lattice of an arrangement.",
author = "M. Cuntz and T. Hoge",
note = "Publisher Copyright: {\textcopyright} 2014 American Mathematical Society. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.",
year = "2015",
month = jan,
day = "1",
doi = "10.1090/s0002-9939-2014-12263-5",
language = "English",
volume = "143",
pages = "35--40",
journal = "Proceedings of the American Mathematical Society",
issn = "0002-9939",
publisher = "American Mathematical Society",
number = "1",

}

Download

TY - JOUR

T1 - Free but not recursively free arrangements

AU - Cuntz, M.

AU - Hoge, T.

N1 - Publisher Copyright: © 2014 American Mathematical Society. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.

PY - 2015/1/1

Y1 - 2015/1/1

N2 - We construct counterexamples to the conjecture that every free arrangement is recursively free in characteristic zero. The intersection lattice of our smallest example has a realization over a finite field which is recursively free, thus recursive freeness is not a combinatorial property of the intersection lattice of an arrangement.

AB - We construct counterexamples to the conjecture that every free arrangement is recursively free in characteristic zero. The intersection lattice of our smallest example has a realization over a finite field which is recursively free, thus recursive freeness is not a combinatorial property of the intersection lattice of an arrangement.

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

U2 - 10.1090/s0002-9939-2014-12263-5

DO - 10.1090/s0002-9939-2014-12263-5

M3 - Article

AN - SCOPUS:84924787251

VL - 143

SP - 35

EP - 40

JO - Proceedings of the American Mathematical Society

JF - Proceedings of the American Mathematical Society

SN - 0002-9939

IS - 1

ER -

Von denselben Autoren