The minkowski property and reflexivity of marked poset polytopes

Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review

Autoren

  • Xin Fang
  • Ghislain Fourier
  • Christoph Pegel

Organisationseinheiten

Externe Organisationen

  • Universität zu Köln
  • Rheinisch-Westfälische Technische Hochschule Aachen (RWTH)
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Seitenumfang19
FachzeitschriftElectronic Journal of Combinatorics
Jahrgang27
Ausgabenummer1
PublikationsstatusVeröffentlicht - 24 Jan. 2020

Abstract

We provide a Minkowski sum decomposition of marked chain-order polytopes into building blocks associated to elementary markings and thus give an explicit minimal set of generators of an associated semi-group algebra. We proceed by characterizing the reflexive polytopes among marked chain-order polytopes as those with the underlying marked poset being ranked.

ASJC Scopus Sachgebiete

Zitieren

The minkowski property and reflexivity of marked poset polytopes. / Fang, Xin; Fourier, Ghislain; Pegel, Christoph.
in: Electronic Journal of Combinatorics, Jahrgang 27, Nr. 1, 24.01.2020.

Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review

Fang X, Fourier G, Pegel C. The minkowski property and reflexivity of marked poset polytopes. Electronic Journal of Combinatorics. 2020 Jan 24;27(1). doi: 10.37236/8144
Fang, Xin ; Fourier, Ghislain ; Pegel, Christoph. / The minkowski property and reflexivity of marked poset polytopes. in: Electronic Journal of Combinatorics. 2020 ; Jahrgang 27, Nr. 1.
Download
@article{b653c8d146a4482fa2ba3525c193598b,
title = "The minkowski property and reflexivity of marked poset polytopes",
abstract = "We provide a Minkowski sum decomposition of marked chain-order polytopes into building blocks associated to elementary markings and thus give an explicit minimal set of generators of an associated semi-group algebra. We proceed by characterizing the reflexive polytopes among marked chain-order polytopes as those with the underlying marked poset being ranked.",
author = "Xin Fang and Ghislain Fourier and Christoph Pegel",
note = "Funding information: Part of the work was carried out during a research visit of X.F. to University of Hannover. He would like to thank University of Hannover for the hospitality. We would like to thank the anonymous reviewers, whose detailed comments helped to improve this work.",
year = "2020",
month = jan,
day = "24",
doi = "10.37236/8144",
language = "English",
volume = "27",
journal = "Electronic Journal of Combinatorics",
issn = "1077-8926",
publisher = "Electronic Journal of Combinatorics",
number = "1",

}

Download

TY - JOUR

T1 - The minkowski property and reflexivity of marked poset polytopes

AU - Fang, Xin

AU - Fourier, Ghislain

AU - Pegel, Christoph

N1 - Funding information: Part of the work was carried out during a research visit of X.F. to University of Hannover. He would like to thank University of Hannover for the hospitality. We would like to thank the anonymous reviewers, whose detailed comments helped to improve this work.

PY - 2020/1/24

Y1 - 2020/1/24

N2 - We provide a Minkowski sum decomposition of marked chain-order polytopes into building blocks associated to elementary markings and thus give an explicit minimal set of generators of an associated semi-group algebra. We proceed by characterizing the reflexive polytopes among marked chain-order polytopes as those with the underlying marked poset being ranked.

AB - We provide a Minkowski sum decomposition of marked chain-order polytopes into building blocks associated to elementary markings and thus give an explicit minimal set of generators of an associated semi-group algebra. We proceed by characterizing the reflexive polytopes among marked chain-order polytopes as those with the underlying marked poset being ranked.

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

U2 - 10.37236/8144

DO - 10.37236/8144

M3 - Article

VL - 27

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

SN - 1077-8926

IS - 1

ER -