Graph explorer

Iterative Desingularization

A simplicial set is said to be non-singular if the representing map of each non-degenerate simplex is degreewise injective. The inclusion into the category of simplicial sets, of the full subcategory whose objects are the non-singular simplicial sets, admits a left adjoint functor called desingularization. In this paper, we provide an iterative description of desingularization that is useful for theoretical purposes as well as for doing calculations.

5 nodes4 linksoverview previewIterative Desingularization
5 nodes4 links
Iterative Desingularization5 visible / 5 total nodes / 4 links
AuthorshipTopic signalTopic signalTopic signalWIterative Desingularizationpreprint / 2020AVegard FjellboResearcherTmath.CO8936 worksTmath.AT1949 worksTmath.CT1150 works
PaperSignal 104 links

Iterative Desingularization

preprint / 2020

Open