Related papers: Primitive path homology
The Rooted Maps Theory, a branch of the Theory of Homology, is shown to be a powerful tool for investigating the topological properties of Feynman diagrams, related to the single particle propagator in the quantum many-body systems. The…
The isometry class of the intersection form of a compact complex surface can be easily determined from complex-analytic invariants. For projective surfaces the primitive lattice is another naturally occurring lattice. The goal of this note…
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…
A network can be analyzed at different topological scales, ranging from single nodes to motifs, communities, up to the complete structure. We propose a novel intermediate-level topological analysis that considers non-overlapping subgraphs…
In this paper, we introduce and study representation homology of topological spaces, which is a natural homological extension of representation varieties of fundamental groups. We give an elementary construction of representation homology…
We develop parallel transport on path spaces from a differential geometric approach, whose integral version connects with the category theoretic approach. In the framework of 2-connections, our approach leads to further development of…
Let $G$ be a fixed graph. Two paths of length $n-1$ on $n$ vertices (Hamiltonian paths) are $G$-different if there is a subgraph isomorphic to $G$ in their union. In this paper we prove that the maximal number of pairwise triangle-different…
Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…
We introduce and develop fine shape, which has a very simple definition and aims to supersede all previously known shape theories for metrizable spaces. The problem with known shape theories of metrizable spaces is illustrated by the…
We discuss families of triples of graphs whose Hosoya indices are primitive Pythagorean triples. Hosoya gave a method to construct such families of caterpillars, i.e., trees whose vertices are within distance 1 of a central path. He also…
A path of a graph $G$ is called a Hamilton path if it passes through all the vertices of $G$. A graph is Hamilton-connected if any two vertices are connected by a Hamilton path. Note that any bipartite graph is not Hamilton-connected. We…
There are different notions of homology and cohomology that can be defined for a group with an action of another group by group automorphisms. In this paper we address three natural questions that arise in this context. Namely, the relation…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
In this text we expose basic cases of some fundamental ideas and methods of topology. Namely, of homotopy, degree, fundamental group, covering, Whitehead invariant, etc. This is done by considering the elementary example: closed polygonal…
In previous work, the first author defined homotopy theories for stratified spaces from a simplicial and a topological perspective. In both frameworks stratified weak-equivalences are detected by suitable generalizations of homotopy links.…
Hypergraphs, as a generalization of simplicial complexes, have long been a subject of interest in their geometric interpretation. The subdivision of simplicial complexes can, to some extent, provide insights into the geometry of simplicial…
We introduce Khovanov homology for ribbon graphs and show that the Khovanov homology of a certain ribbon graph embedded on the Turaev surface of a link is isomorphic to the Khovanov homology of the link (after a grading shift). We also…
Stratified digraphs are popular models for feedforward neural networks. However, computation of their path homologies has been limited to low dimensions due to high computational complexity. A recursive algorithm is proposed to compute…
We show that the spaces of holomorphic and continuous maps from a smooth complex projective variety to a projective space have the same homology in a range depending on the degree of the maps.
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…