Simplicial Arrangements with up to 27 Lines

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Autorschaft

Externe Organisationen

  • Technische Universität Kaiserslautern
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Seiten (von - bis)682-701
Seitenumfang20
FachzeitschriftDiscrete and Computational Geometry
Jahrgang48
Ausgabenummer3
PublikationsstatusVeröffentlicht - 1 Okt. 2012
Extern publiziertJa

Abstract

We compute all isomorphism classes of simplicial arrangements in the real projective plane with up to 27 lines. It turns out that Grünbaum's catalogue is complete up to 27 lines except for four new arrangements with 22, 23, 24, 25 lines, respectively. As a byproduct we classify simplicial arrangements of pseudolines with up to 27 lines. In particular, we disprove Grünbaum's conjecture about unstretchable arrangements with at most 16 lines, and prove the conjecture that any simplicial arrangement with at most 14 pseudolines is stretchable.

ASJC Scopus Sachgebiete

Zitieren

Simplicial Arrangements with up to 27 Lines. / Cuntz, M.
in: Discrete and Computational Geometry, Jahrgang 48, Nr. 3, 01.10.2012, S. 682-701.

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Cuntz M. Simplicial Arrangements with up to 27 Lines. Discrete and Computational Geometry. 2012 Okt 1;48(3):682-701. doi: 10.1007/s00454-012-9423-7
Download
@article{112fefd2b04c4553ae06f74fe6bac093,
title = "Simplicial Arrangements with up to 27 Lines",
abstract = "We compute all isomorphism classes of simplicial arrangements in the real projective plane with up to 27 lines. It turns out that Gr{\"u}nbaum's catalogue is complete up to 27 lines except for four new arrangements with 22, 23, 24, 25 lines, respectively. As a byproduct we classify simplicial arrangements of pseudolines with up to 27 lines. In particular, we disprove Gr{\"u}nbaum's conjecture about unstretchable arrangements with at most 16 lines, and prove the conjecture that any simplicial arrangement with at most 14 pseudolines is stretchable.",
keywords = "Arrangement of hyperplanes, Pseudoline, Simplicial, Wiring",
author = "M. Cuntz",
year = "2012",
month = oct,
day = "1",
doi = "10.1007/s00454-012-9423-7",
language = "English",
volume = "48",
pages = "682--701",
journal = "Discrete and Computational Geometry",
issn = "0179-5376",
publisher = "Springer New York",
number = "3",

}

Download

TY - JOUR

T1 - Simplicial Arrangements with up to 27 Lines

AU - Cuntz, M.

PY - 2012/10/1

Y1 - 2012/10/1

N2 - We compute all isomorphism classes of simplicial arrangements in the real projective plane with up to 27 lines. It turns out that Grünbaum's catalogue is complete up to 27 lines except for four new arrangements with 22, 23, 24, 25 lines, respectively. As a byproduct we classify simplicial arrangements of pseudolines with up to 27 lines. In particular, we disprove Grünbaum's conjecture about unstretchable arrangements with at most 16 lines, and prove the conjecture that any simplicial arrangement with at most 14 pseudolines is stretchable.

AB - We compute all isomorphism classes of simplicial arrangements in the real projective plane with up to 27 lines. It turns out that Grünbaum's catalogue is complete up to 27 lines except for four new arrangements with 22, 23, 24, 25 lines, respectively. As a byproduct we classify simplicial arrangements of pseudolines with up to 27 lines. In particular, we disprove Grünbaum's conjecture about unstretchable arrangements with at most 16 lines, and prove the conjecture that any simplicial arrangement with at most 14 pseudolines is stretchable.

KW - Arrangement of hyperplanes

KW - Pseudoline

KW - Simplicial

KW - Wiring

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

U2 - 10.1007/s00454-012-9423-7

DO - 10.1007/s00454-012-9423-7

M3 - Article

AN - SCOPUS:84865637465

VL - 48

SP - 682

EP - 701

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

SN - 0179-5376

IS - 3

ER -

Von denselben Autoren