Related papers: Which Vertical Graphs are Non VPHT Reconstructible…

Let $\Gamma$ be a connected bridgeless metric graph, and fix a point $v$ of $\Gamma$. We define combinatorial iterated integrals on $\Gamma$ along closed paths at $v$, a unipotent generalization of the usual cycle pairing and the…

Persistent homology is a mathematical tool used for studying the shape of data by extracting its topological features. It has gained popularity in network science due to its applicability in various network mining problems, including…

Generalizing a pretrained model to unseen datasets without retraining is an essential step toward a foundation model. However, achieving such cross-dataset, fully inductive inference is difficult in graph-structured data where feature…

A topological space ${\mathcal X}$ is reversible iff each continuous bijection (condensation) $f: {\mathcal X} \rightarrow {\mathcal X}$ is a homeomorphism; weakly reversible iff whenever ${\mathcal Y}$ is a space and there are…

The persistent homology transform (PHT) of a subset $M \subset \mathbb{R}^d$ is a map $\text{PHT}(M):\mathbb{S}^{d-1} \to \mathbf{Dgm}$ from the unit sphere to the space of persistence diagrams. This map assigns to each direction $v\in…

We construct a complete invariant for non-wandering surface flows with finitely many singular points but without locally dense orbits. Precisely, we show that a flow $v$ with finitely many singular points on a compact connected surface $S$…

We begin the study the algebraic topology of semi-coarse spaces, which are generalizations of coarse spaces that enable one to endow non-trivial `coarse-like' structures to compact metric spaces, something which is impossible in coarse…

Persistent homology is a cornerstone of topological data analysis, offering a multiscale summary of topology with robustness to nuisance transformations, such as rotations and small deformations. Persistent homology has seen broad use…

Given a tree and a set ${\cal P}$ of non-trivial simple paths on it, $VPT({\cal P})$ is the VPT graph (i.e. the vertex intersection graph) of the paths ${\cal P}$ of the tree $T$, and $EPT({\cal P})$ is the EPT graph (i.e. the edge…

We examine a variant of hypergraphs that we call interfaced linear hypergraphs, with the aim of creating a sound and complete graphical language for symmetric traced monoidal categories (STMCs) suitable for graph rewriting. In particular,…

We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…

We prove that the complex of proper non-trivial non-degenerate subspaces of a finite-dimensional vector space endowed with a non-degenerate sesquilinear form is homotopy equivalent to a wedge of spheres. Additionally, we show that the same…

The Euler characteristic transform (ECT) is an integral transform used widely in topological data analysis. Previous efforts by Curry et al. and Ghrist et al. have independently shown that the ECT is injective on all compact definable sets.…

Data representation in non-Euclidean spaces has proven effective for capturing hierarchical and complex relationships in real-world datasets. Hyperbolic spaces, in particular, provide efficient embeddings for hierarchical structures. This…

We give a natural notion of nondegeneracy for singular points of integrable non-Hamiltonian systems, and show that such nondegenerate singularities are locally geometrically linearizable and deformation rigid in the analytic case. We…

The Fundamental Morphism Theorem is a categorical version of the First Noether Isomorphism Theorem for categories that do not have kernels or cokernels. We consider two categories of graphs. Both categories will admit graphs with multiple…

We study the topology associated with physical vector and scalar fields. A mathematical object, e.g., a ball, can be continuously deformed, without tearing or gluing, to make other topologically equivalent objects, e.g., a cube or a solid…

Graph manifolds are a class of compact, orientable 3-manifolds introduced in 1967 by Waldhausen as a generalization of Seifert fibered 3-manifolds. From the point of view of Thurston's geometrization program, graph manifolds are exactly the…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

Smooth vector fields on $\mathbb{R}^n$ can be decomposed into the sum of a gradient vector field and divergence-free (solenoidal) vector field under suitable hypotheses. This is called the Helmholtz-Hodge decomposition (HHD), which has been…