50 citations · 125 across the 28 of their papers we have counts for
4 papers · 1 filter
Non-embeddability of geometric lattices and buildings
Martin Tancer, Kathrin Vorwerk
A fundamental question for simplicial complexes is to find the lowest dimensional Euclidean space in which they can be embedded. We investigate this question for order complexes of…
Recognition of collapsible complexes is NP-complete
Martin Tancer
We prove that it is NP-complete to decide whether a given (3-dimensional) simplicial complex is collapsible. This work extends a result of Malgouyres and Francés showing that it is…
Simplifying inclusion-exclusion formulas
Xavier Goaoc, Jiří Matoušek, Pavel Paták +2
Let be a family of sets on a ground set , such as a family of balls in . For every finite measure on , such that t…
Good covers are algorithmically unrecognizable
Martin Tancer, Dmitry Tonkonog
A good cover in R^d is a collection of open contractible sets in R^d such that the intersection of any subcollection is either contractible or empty. Motivated by an analogy with c…