Papers
Topics
Authors
Recent
Search
2000 character limit reached

The generic combinatorial simplex

Published 3 Jan 2020 in math.LO, math.AT, math.CO, and math.CT | (2001.00908v2)

Abstract: We employ projective Fra\"iss\'e theory to define the "generic combinatorial nn-simplex" as the pro-finite, simplicial complex that is canonically associated with a family of simply defined selection maps between finite triangulations of the simplex. The generic combinatorial nn-simplex is a combinatorial object that can be used to define the geometric realization of a simplicial complex without any reference to the Euclidean space. It also reflects dynamical properties of its homeomorphism group down to finite combinatorics. As part of our study of the generic combinatorial simplex, we define and prove results on domination closure for Fra\"iss\'e classes, and we develop further the theories of stellar moves and cellular maps. We prove that the domination closure of selection maps contains the class of face-preserving simplicial maps that are cellular on each face of the nn-simplex and is contained in the class of simplicial, face-preserving near-homeomorphisms. Under the PL-Poincar\'e conjecture, this gives a characterization of the domination closure of selections.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.