Related papers: Generalized Persistence Diagrams for Persistence M…

The main goal of this article is to construct some geometric invariants for the topology of the set $\mathcal{F}$ of flat connections on a principal $G$-bundle $P\,\longrightarrow\, M$. Although the characteristic classes of principal…

In this paper, we first introduce and study the notion of random Chebyshev centers. Further, based on the recently developed theory of stable sets, we introduce the notion of random complete normal structure so that we can prove the two…

This article obtains purely metric counterparts of cornerstone results in the theory of embedding graphs into normed spaces. Our first main result is a metric analogue of Matou\v{s}ek's extrapolation relating the Poincar\'e constants…

In this paper, we establish a coupling lemma for standard families in the setting of piecewise expanding interval maps with countably many branches. Our method merely requires that the expanding map satisfies Chernov's one-step expansion at…

A fundamental tool in topological data analysis is persistent homology, which allows extraction of information from complex datasets in a robust way. Persistent homology assigns a module over a principal ideal domain to a one-parameter…

The \begin{it} Invariance Theorem \end{it} of M. Gerstenhaber and S. D. Schack states that if $\mathbb{A}$ is a diagram of algebras then the subdivision functor induces a natural isomorphism between the Yoneda cohomologies of the category…

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

Let $\mathscr{P}$ be a poset and $\mathcal{S}$ a sequence of $n$ finite substes of $\mathscr{P}$. The Jordan type of a $\mathscr{P}$-persistence module $M$ at $\mathcal{S}$, denoted by $\mathsf{J}_{\mathcal{S}}(M) \in \mathbb{N}^n$, is…

We apply poset cocalculus, a functor calculus framework for functors out of a poset, to study the problem of decomposing multipersistence modules into simpler components. We both prove new results in this topic and offer a new perspective…

We propose a new concept of generalized differentiation of set-valued maps that captures the first order information. This concept encompasses the standard notions of Frechet differentiability, strict differentiability, calmness and…

S.Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529--563] defined limits of finite posets in parallel to the emerging theory of limits of dense graphs. We prove that each poset limit can be represented as a…

Monadically stable and monadically NIP classes of structures were initially studied in the context of model theory and defined in logical terms. They have recently attracted attention in the area of structural graph theory, as they…

In this paper we show that if $(y_n)$ is a seminormalized sequence in a Banach space which does not have any weakly convergent subsequence, then it contains a wide-$(s)$ subsequence $(x_n)$ which admits an equivalent convex basic sequence.…

In this article, for generalized projective spaces with any weights, we prove four main theorems in three different contexts where the Unital Set Condition USC (Definition $2.8$) on ideals is further examined. In the first context we prove,…

We give a description of a weakly continuous rank preserving map on a reflexive algebra on complex Hilbert space with commutative completely distributive subspace lattice. We show that the implementation of a rank preserving map can be…

Let $G$ be a locally compact group. For every $G$-flow $X$, one can consider the stabilizer map $x \mapsto G_x$, from $X$ to the space $\mathrm{Sub}(G)$ of closed subgroups of $G$. This map is not continuous in general. We prove that if one…

This is the third in a sequence of three papers in which we prove the following generalization of Thomassen's 5-choosability theorem: Let $G$ be a finite graph embedded on a surface of genus $g$. Then $G$ can be $L$-colored, where $L$ is a…

One method for obtaining generalizable solutions to machine learning tasks when presented with diverse training environments is to find \textit{invariant representations} of the data. These are representations of the covariates such that…

A lower bound for the interleaving distance on persistence vector spaces is given in terms of rank invariants. This offers an alternative proof of the stability of rank invariants.

We prove two general decomposition theorems for fixed-point invariants: one for the Lefschetz number and one for the Reidemeister trace. These theorems imply the familiar additivity results for these invariants. Moreover, the proofs of…