Some Conjectures Concerning Complexity of PL subdivisions
Work
Year: 2012
Type: article
Abstract: The main purpose of this note is to formulate a few conjectures in the field of computational PL topology concerning the asymptotic number of iterations of barycentric subdivisions needed to embed one... more
Author Dmitry N. Kozlov
Institution University of Bremen
Cites: 6
Cited by: 1
Related to: 10
FWCI: 0.334
Citation percentile (by year/subfield): 29.47
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: gold