We define the robustness of a level set homology class of a function f : X R as the magnitude of a perturbation necessary to kill the class. Casting this notion into a group theor...
Paul Bendich, Herbert Edelsbrunner, Dmitriy Morozo...
: We deal in this paper with strategical languages of infinite words, that is those generated by a nondeterministic strategy in the sense of game theory. We first show the existenc...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstruc...
In recent years, a number of machine learning algorithms have been developed for the problem of ordinal classification. These algorithms try to exploit, in one way or the other, t...
Escard´o, Hofmann and Streicher showed that real-number computations in the interval-domain environment are inherently parallel, in the sense that they imply the presence of weak...