Complexity Yardsticks for f-Vectors of Polytopes and Spheres

Eran Nevo

doi:10.1007/s00454-019-00138-2

Complexity Yardsticks for f-Vectors of Polytopes and Spheres

Eran Nevo

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

We consider geometric and computational measures of complexity for sets of integer vectors, asking for a qualitative difference between f-vectors of simplicial and general d-polytopes, as well as flag f-vectors of d-polytopes and regular CW (d- 1) -spheres, for d≥ 4.

Original language	English
Pages (from-to)	347-354
Number of pages	8
Journal	Discrete and Computational Geometry
Volume	64
Issue number	2
DOIs	https://doi.org/10.1007/s00454-019-00138-2
State	Published - 1 Sep 2020
Externally published	Yes

Keywords

Computational complexity
Polytope
f-vector

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1007/s00454-019-00138-2

Cite this

@article{8b0ecbd63f804e0db72322dd5d9bd184,

title = "Complexity Yardsticks for f-Vectors of Polytopes and Spheres",

abstract = "We consider geometric and computational measures of complexity for sets of integer vectors, asking for a qualitative difference between f-vectors of simplicial and general d-polytopes, as well as flag f-vectors of d-polytopes and regular CW (d- 1) -spheres, for d≥ 4.",

keywords = "Computational complexity, Polytope, f-vector",

author = "Eran Nevo",

note = "Publisher Copyright: {\textcopyright} 2019, Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2020",

month = sep,

day = "1",

doi = "10.1007/s00454-019-00138-2",

language = "English",

volume = "64",

pages = "347--354",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - Complexity Yardsticks for f-Vectors of Polytopes and Spheres

AU - Nevo, Eran

PY - 2020/9/1

Y1 - 2020/9/1

N2 - We consider geometric and computational measures of complexity for sets of integer vectors, asking for a qualitative difference between f-vectors of simplicial and general d-polytopes, as well as flag f-vectors of d-polytopes and regular CW (d- 1) -spheres, for d≥ 4.

AB - We consider geometric and computational measures of complexity for sets of integer vectors, asking for a qualitative difference between f-vectors of simplicial and general d-polytopes, as well as flag f-vectors of d-polytopes and regular CW (d- 1) -spheres, for d≥ 4.

KW - Computational complexity

KW - Polytope

KW - f-vector

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

U2 - 10.1007/s00454-019-00138-2

DO - 10.1007/s00454-019-00138-2

M3 - Article

AN - SCOPUS:85074460481

SN - 0179-5376

VL - 64

SP - 347

EP - 354

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

IS - 2

ER -

Complexity Yardsticks for f-Vectors of Polytopes and Spheres

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this