Persistent Graphs and Cyclic Polytope Triangulations
Persistent Graphs and Cyclic Polytope Triangulations
About this item
Full title
Author / Creator
Publisher
Berlin/Heidelberg: Springer Berlin Heidelberg
Journal title
Language
English
Formats
Publication information
Publisher
Berlin/Heidelberg: Springer Berlin Heidelberg
Subjects
More information
Scope and Contents
Contents
We prove a bijection between the triangulations of the 3-dimensional cyclic poly-tope
C
(
n
+ 2, 3) and persistent graphs with
n
vertices. We show that under this bijection the Stasheff-Tamari orders on triangulations naturally translate to subgraph inclusion between persistent graphs. Moreover, we describe a connection to the sec...
Alternative Titles
Full title
Persistent Graphs and Cyclic Polytope Triangulations
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2549233914
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2549233914
Other Identifiers
ISSN
0209-9683
E-ISSN
1439-6912
DOI
10.1007/s00493-020-4369-5
