Resumen de Fast positive Plücker trees
We report on a re-implementation in C++ of the search for non-realizability certificatesfor simplicial spheres in the form of positive Pl¨ucker trees [16]. On the one hand, thisimplementation is orders of magnitudes faster than the previous one, does not need linearor integer solvers anymore, and finds certificates in seconds that are completely out of reachof the related implementation by Gouveia et al [9]. On the other, our method misses somecertificates that Gouveia et al do find, so that these methods are genuinely complementary.
