Some Conjectures Concerning Complexity of PL subdivisions

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.