Related papers: Decomposing zero-dimensional persistent homology o…
Magnitude homology is an emerging framework that captures the intrinsic topological and geometric features of metric spaces, demonstrating significant potential for topoplogical data analysis and geometric data analysis. This work…
We develop a novel tool to study the fixed point property of finite posets using a topological approach. Our tool is a construction which turns out to induce an endofunctor of the homotopy category of finite $T_0$--spaces. We study many…
We establish a purely geometric form of the concentration theorem (also called localization theorem) for actions of a linearly reductive group $G$ on an affine scheme $X$ over an affine base scheme $S$. It asserts the existence of a…
We show that in a finite tensor category, the tensor product property holds for support varieties if and only if it holds between indecomposable periodic objects. We apply this to certain Hopf algebras in the form of skew group algebras. In…
In this article, we introduce the notion of a functor on coarse spaces being coarsely excisive- a coarse analogue of the notion of a functor on topological spaces being excisive. Further, taking cones, a coarsely excisive functor yields a…
Persistent homology was shown by Carlsson and Zomorodian to be homology of graded chain complexes with coefficients in the graded ring $\kk[t]$. As such, the behavior of persistence modules -- graded modules over $\kk[t]$ is an important…
Computational topology provides a tool, persistent homology, to extract quantitative descriptors from structured objects (images, graphs, point clouds, etc). These descriptors can then be involved in optimization problems, typically as a…
Category is put to work in the non-associative realm in the article. We focus on a typical example of non-associative category. Its objects are octonionic bimodules, morphisms are octonionic para-linear maps, and compositions are…
Multidimensional persistence has been proposed to study the persistence of topological features in data indexed by multiple parameters. In this work, we further explore its algebraic complications from the point of view of higher…
Recently a new kind of approximation to continuum topological spaces has been introduced, the approximating spaces being partially ordered sets (posets) with a finite or at most a countable number of points. The partial order endows a poset…
In 1920s R. L. Moore introduced \emph{upper semicontinuous} and \emph{lower semicontinuous} decompositions in studying decomposition spaces. Upper semicontinuous decompositions were studied very well by himself and later by R.H. Bing in…
When working with (multi-parameter) persistence modules, one usually makes some type of tameness assumption in order to obtain better control over their algebraic behavior. One such notion is Ezra Millers notion of finite encodability,…
The homological information about a filtered simplicial complex over the poset of positive real numbers is often presented by a barcode which depicts the evolution of the associated Betti numbers. However, there is a wonderfully complex…
A representation embedding between cartesian theories can be defined to be a functor between respective categories of models that preserves finitely-generated projective models and that preserves and reflects certain epimorphisms. This…
Termination property of functions is an important issue in computability theory. In this paper, we show that repeated iterations of a function can induce an order amongst the elements of its domain set. Hasse diagram of the poset, thus…
The aim of the present paper is to show that the concept of intuitionistic logic based on a Heyting algebra can be generalized in such a way that it is formalized by means of a bounded poset. In this case it is not assumed that the poset is…
In this paper we give a metric construction of a tree which correctly identifies connected components of superlevel sets of $\mathbb{R}$-valued continuous functions $f$ on $X$ and show that it is possible to retrieve the $H_0$-persistent…
Persistent homology is a widely used tool in Topological Data Analysis that encodes multiscale topological information as a multi-set of points in the plane called a persistence diagram. It is difficult to apply statistical theory directly…
Given a stratified variety X with strata satisfying a cohomological parity-vanishing condition, we define and show the uniqueness of "parity sheaves", which are objects in the constructible derived category of sheaves with coefficients in…
We study the problem of existence and uniqueness of homotopy colimits in stable representation theory, where one typically does not have model category structures to guarantee that these homotopy colimits exist or have good properties. We…