On arrangements of hyperplanes from connected subgraphs

Publikation: Arbeitspapier/PreprintPreprint

Autoren

Externe Organisationen

  • Universität Bielefeld
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Seitenumfang22
PublikationsstatusAngenommen/Im Druck - 16 Nov. 2023

Abstract

We investigate arrangements of hyperplanes whose normal vectors are given by connected subgraphs of a fixed graph. These include the resonance arrangement and certain ideal subarrangements of Weyl arrangements. We characterize those which are free, simplicial, factored, or supersolvable. In particular, such an arrangement is free if and only if the graph is a cycle, a path, an almost path, or a path with a triangle attached to it.

Zitieren

On arrangements of hyperplanes from connected subgraphs. / Cuntz, Michael; Kühne, Lukas.
2023.

Publikation: Arbeitspapier/PreprintPreprint

Download
@techreport{a47baa661daf45c1b41380ca8de6848b,
title = "On arrangements of hyperplanes from connected subgraphs",
abstract = "We investigate arrangements of hyperplanes whose normal vectors are given by connected subgraphs of a fixed graph. These include the resonance arrangement and certain ideal subarrangements of Weyl arrangements. We characterize those which are free, simplicial, factored, or supersolvable. In particular, such an arrangement is free if and only if the graph is a cycle, a path, an almost path, or a path with a triangle attached to it.",
author = "Michael Cuntz and Lukas K{\"u}hne",
year = "2023",
month = nov,
day = "16",
language = "English",
type = "WorkingPaper",

}

Download

TY - UNPB

T1 - On arrangements of hyperplanes from connected subgraphs

AU - Cuntz, Michael

AU - Kühne, Lukas

PY - 2023/11/16

Y1 - 2023/11/16

N2 - We investigate arrangements of hyperplanes whose normal vectors are given by connected subgraphs of a fixed graph. These include the resonance arrangement and certain ideal subarrangements of Weyl arrangements. We characterize those which are free, simplicial, factored, or supersolvable. In particular, such an arrangement is free if and only if the graph is a cycle, a path, an almost path, or a path with a triangle attached to it.

AB - We investigate arrangements of hyperplanes whose normal vectors are given by connected subgraphs of a fixed graph. These include the resonance arrangement and certain ideal subarrangements of Weyl arrangements. We characterize those which are free, simplicial, factored, or supersolvable. In particular, such an arrangement is free if and only if the graph is a cycle, a path, an almost path, or a path with a triangle attached to it.

M3 - Preprint

BT - On arrangements of hyperplanes from connected subgraphs

ER -

Von denselben Autoren