Please use this identifier to cite or link to this item:
https://scidar.kg.ac.rs/handle/123456789/8390
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.rights.license | openAccess | - |
dc.contributor.author | Jevtić F. | - |
dc.contributor.author | Timotijević, Marinko | - |
dc.contributor.author | Živaljević R. | - |
dc.date.accessioned | 2020-09-19T15:36:49Z | - |
dc.date.available | 2020-09-19T15:36:49Z | - |
dc.date.issued | 2019 | - |
dc.identifier.issn | 0179-5376 | - |
dc.identifier.uri | https://scidar.kg.ac.rs/handle/123456789/8390 | - |
dc.description.abstract | © 2019, Springer Science+Business Media, LLC, part of Springer Nature. The problem of deciding if a given triangulation of a sphere can be realized as the boundary sphere of a simplicial, convex polytope is known as the ‘Simplicial Steinitz problem’. It is known by an indirect and non-constructive argument that a vast majority of Bier spheres are non-polytopal. Contrary to that, we demonstrate that the Bier spheres associated to threshold simplicial complexes are all polytopal. Moreover, we show that all Bier spheres are starshaped. We also establish a connection between Bier spheres and Kantorovich–Rubinstein polytopes by showing that the boundary sphere of the KR-polytope associated to a polygonal linkage (weighted cycle) is isomorphic to the Bier sphere of the associated simplicial complex of “short sets”. | - |
dc.rights | info:eu-repo/semantics/openAccess | - |
dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/4.0/ | - |
dc.source | Discrete and Computational Geometry | - |
dc.title | Polytopal Bier Spheres and Kantorovich–Rubinstein Polytopes of Weighted Cycles | - |
dc.type | article | - |
dc.identifier.doi | 10.1007/s00454-019-00151-5 | - |
dc.identifier.scopus | 2-s2.0-85075376429 | - |
Appears in Collections: | Faculty of Science, Kragujevac |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
10.1007-s00454-019-00151-5.pdf | 199.44 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License