Related papers: Greedy Morse matchings and discrete smoothness
We prove that many completeness properties coincide in metric spaces, precompact groups and dense subgroups of products of separable metric groups. We apply these results to function spaces C_p(X,G) of G-valued continuous functions on a…
Graph manifolds form important classes of $3$-dimensional closed and orientable manifolds. For example, {\it Seifert} manifolds are graph manifolds where hyperbolic manifolds are not. In applying singularity theory of differentiable maps to…
This is a note on the graphs of two smooth real-valued functions in the plane with no intersection and the natural map onto the region surrounded by them with the canonical projection to the line composed, yielding its Reeb space. The Reeb…
We generalize Forman's discrete Morse theory to the context of symmetric $\Delta$-complexes. As an application, we prove that the coloop subcomplex of the link of the origin $LA^{\mathrm{trop},\mathrm{P}}_g$ in the moduli space of…
The Witten index for certain supersymmetric lattice models treated by de Boer, van Eerten, Fendley, and Schoutens, can be formulated as a topological invariant of simplicial complexes arising as independence complexes of graphs. We prove a…
We study the rational homology of the Deligne--Mumford compactification $\overline{\mathcal M}_{g,n}$ of the moduli space of stable curves via a family of Morse functions, namely the $\text{sys}_T$ functions. Exploiting the geometric and…
A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…
In this thesis, we present various contributions to the study of free boundary minimal surfaces. After introducing some basic tools and discussing some delicate aspects related to the definition of Morse index when allowing for a contact…
We present a detailed introduction of the theory of constructible sheaf complexes in the complex algebraic and analytic setting. All concepts are illustrated by many interesting examples and relevant applications, while some important…
This paper concerns algorithms that give correct answers with (asymptotic) density $1$. A dense description of a function $g : \omega \to \omega$ is a partial function $f$ on $\omega$ such that $\left\{n : f(n) = g(n)\right\}$ has density…
Neural representations are not unique objects. Even when two systems realize the same downstream computation, their hidden coordinates may differ by reparameterization. A probe family intended to reveal structure already present in a…
In this paper, we study the computation of optimal discrete Morse functions on stratifolds. In particular, we present an algorithm that efficiently computes such functions for a broad class of them. Moreover, we characterize the conditions…
As a higher dimensional version of the theory of Morse functions, there have been various studies of smooth manifolds using generic smooth maps. As fundamental results, in these studies, they have found that inverse images of such maps…
Let C be a smooth projective curve over a discretely valued field K, defined by an affine equation f(x,y)=0. We construct a model of C over the ring of integers of K using a toroidal embedding associated to the Newton polygon of f. We show…
Flatness of discrete-time systems can be characterized by two simple properties. There exists a map, a submersion, from the flat coordinates and their forward shifts to the state and the input of the discrete-time system, such that the…
We prove that projectivised finite-dimensional linear random dynamical systems possess a unique finest weak Morse decomposition. Based on this result, we define the Morse spectrum and investigate its basic properties. In particular, we show…
Smooth parametrization consists in a subdivision of the mathematical objects under consideration into simple pieces, and then parametric representation of each piece, while keeping control of high order derivatives. The main goal of the…
The classical approach to the study of dynamical systems consists in representing the dynamics of the system in the form of a "source-sink", that means identifying an attractor-repeller pair, which are attractor-repellent sets for all other…
Fairness in machine learning is increasingly critical, yet standard approaches often treat data as static points in a high-dimensional space, ignoring the underlying generative structure. We posit that sensitive attributes (e.g., race,…
We prove that a connected simplicial complex is uniquely determined by its complex of discrete Morse functions. This settles a question raised by Chari and Joswig. In the 1-dimensional case, this implies that the complex of rooted forests…