Related papers: Geometric and analytic structures on the higher ad…
In 1989 H. Tverberg proposed a quite general conjecture in Discrete geometry, which could be considered as the common basis for many results in Combinatorial geometry and at the same time as a discrete analogue of the common transversal…
Using tools from topology and functional analysis, we provide a framework where artificial neural networks, and their architectures, can be formally described. We define the notion of machine in a general topological context and show how…
We set up a framework for using algebraic geometry to study the generalised cohomology rings that occur in algebraic topology. This idea was probably first introduced by Quillen and it underlies much of our understanding of complex oriented…
Geometric, topological and graph theory modeling and analysis of biomolecules are of essential importance in the conceptualization of molecular structure, function, dynamics, and transport. On the one hand, geometric modeling provides…
The enduring legacy of Euclidean geometry underpins classical machine learning, which, for decades, has been primarily developed for data lying in Euclidean space. Yet, modern machine learning increasingly encounters richly structured data…
It is shown that a surjective monotone map $X\to Y$ between finite $T_0$-spaces induces a surjective map on homology. As such a map turns out to be a sequence of edge contractions in the Hasse diagram of $X$, followed by a homeomorphism,…
An ultrametric topology formalizes the notion of hierarchical structure. An ultrametric embedding, referred to here as ultrametricity, is implied by a hierarchical embedding. Such hierarchical structure can be global in the data set, or…
Structural topology optimization (TO) is central to engineering design but remains computationally intensive due to complex physics and hard constraints. Existing deep-learning methods are limited to fixed square grids, a few hand-coded…
A primary hypothesis that drives scientific and engineering studies is that data has structure. The dominant paradigms for describing such structure are statistics (e.g., moments, correlation functions) and signal processing (e.g.,…
Incorporating geometric inductive biases into models can aid interpretability and generalization, but encoding to a specific geometric structure can be challenging due to the imposed topological constraints. In this paper, we theoretically…
This work is concerned with a representation of shapes that disentangles fine, local and possibly repeating geometry, from global, coarse structures. Achieving such disentanglement leads to two unrelated advantages: i) a significant…
We show that any of a large class of schemes receives a universal homeomorphism from a reduced scheme that in turn receives no nontrivial universal homeomorphism from any other reduced scheme. This construction serves as a categorical input…
There are different definitions of ends in non-locally-finite graphs which are all equivalent in the locally finite case. We prove the compactness of the end-topology that is based on the principle of removing finite sets of vertices and…
Generalized topological spaces in the sense of Cs\'{a}sz\'{a}r have two main features which distinguish them from typical topologies. First, these families of subsets are not closed under intersections. Second, we allow for the possibility…
We set up the geometric background necessary to extend rigid cohomology from the case of algebraic varieties to the case of general locally noetherian formal schemes. In particular, we generalize Berthelot's strong fibration theorem to adic…
An embedding of chaotic data into a suitable phase space creates a diffeomorphism of the original attractor with the reconstructed attractor. Although diffeomorphic, the original and reconstructed attractors may not be topologically…
In this text, we outline a theory of schemes associated with a site, which generalizes a variety of geometries, such as manifolds, schemes, analytic spaces, simplicial complexes, and more. We present an abstract process of gluing model…
Algorithmicists are well-aware that fast dynamic programming algorithms are very often the correct choice when computing on compositional (or even recursive) graphs. Here we initiate the study of how to generalize this folklore intuition to…
In 1986, Kato set up a framework of conjectures relating (higher) $0$-cycles and \'etale cohomology for smooth projective schemes over finite fields or rings of integers in local fields through the homology of so-called Kato complexes. In…
A new approach to \'etale homotopy theory is presented which applies to a much broader class of objects than previously existing approaches, namely it applies not only to all schemes (without any local Noetherian hypothesis), but also to…