Related papers: Which Vertical Graphs are Non VPHT Reconstructible…
Topological data analysis leverages topological features to analyze datasets, with applications in diverse fields like medical sciences and biology. A key tool of this theory is the persistence diagram, which encodes topological information…
We show that for every fixed undirected graph $H$, there is a $O(|V(G)|^3)$ time algorithm that tests, given a graph $G$, if $G$ contains $H$ as a topological subgraph (that is, a subdivision of $H$ is subgraph of $G$). This shows that…
In this paper we extend the classical theory of combinatorial manifolds to the non-homogeneous setting. NH-manifolds are polyhedra which are locally like Euclidean spaces of varying dimensions. We show that many of the properties of…
We wish to attack the problems that H.~Anciaux and K.~Panagiotidou posed in [1], for non-degenerate real hypersurfaces in indefinite complex projective space. We will slightly change these authors' point of view, obtaining cleaner equations…
A graph H is strongly immersed in G if H is obtained from G by a sequence of vertex splittings (i.e., lifting some pairs of incident edges and removing the vertex) and edge removals. Equivalently, vertices of H are mapped to distinct…
In this document, we propose a bridge between the graphs and the geometric realizations of their Vietoris Rips complexes, i.e. Graphs, with their canonical \v{C}ech closure structure, have the same homotopy type that the realization of…
We present a new approach, the Topograph, which reconstructs underlying physics processes, including the intermediary particles, by leveraging underlying priors from the nature of particle physics decays and the flexibility of message…
The signature of a $p$-weakly geometric rough path summarises a path up to a generalised notion of reparameterisation. The quotient space of equivalence classes on which the signature is constant yields unparameterised path space. The study…
A vector topology on a vector space over a topological field is a (not necessarily Hausdorff) topology by which the addition and scalar multiplication are continuous. We prove that, if an isomorphism between the lattice of topologies of two…
Graph covers are a way to describe continuous maps (and homeomorphisms) of a Cantor set, more generally than e.g.\ Bratteli-Vershik systems. Every continuous map on a zero-dimensional compact set can be expressed by a graph cover (e.g.\…
Inferring topological and geometrical information from data can offer an alternative perspective on machine learning problems. Methods from topological data analysis, e.g., persistent homology, enable us to obtain such information,…
This paper shows that the topological structures of particle orbits generated by a generic class of vector fields on spherical surfaces, called {\it the flow of finite type}, are in one-to-one correspondence with discrete structures such as…
Geometric graphs are a special kind of graph with geometric features, which are vital to model many scientific problems. Unlike generic graphs, geometric graphs often exhibit physical symmetries of translations, rotations, and reflections,…
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the notion of a recognizable set of graphs in terms of finite…
In light of Lov\'{a}sz's longstanding question on the existence of Hamilton paths in vertex-transitive graphs, this paper considers a natural variant: what if vertex-transitivity is relaxed, yet a high degree of symmetry--specifically…
Persistent homology (PH) is a recently developed theory in the field of algebraic topology to study shapes of datasets. It is an effective data analysis tool that is robust to noise and has been widely applied. We demonstrate a general…
Persistent homology (PH) is a method used in topological data analysis (TDA) to study qualitative features of data that persist across multiple scales. It is robust to perturbations of input data, independent of dimensions and coordinates,…
Two graphs $G$ and $H$ are \emph{hypomorphic} if there exists a bijection $\varphi \colon V(G) \rightarrow V(H)$ such that $G - v \cong H - \varphi(v)$ for each $v \in V(G)$. A graph $G$ is \emph{reconstructible} if $H \cong G$ for all $H$…
For a countable discrete space V, every nondegenerate separable C*-correspondence over c_0(V) is isomorphic to one coming from a directed graph with vertex set V. In this paper we demonstrate why the analogous characterizations fail to hold…
A path system $\mathcal{P}$ in a graph $G=(V,E)$ is said to be irreducible if there does not exist a partition $V= A\sqcup B$ such that $\mathcal{P}$ restricts to a path system on both $G[A]$ and $G[B]$. In this paper, we construct an…