| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 422517 | Electronic Notes in Theoretical Computer Science | 2012 | 5 Pages |
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 geometric simplicial complex into another one.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
