Related papers: On discrete loop signatures and Markov loops topol…
In this paper we relate the study of actions of discrete groups over connected manifolds to that of their orbit spaces seen as differentiable stacks. We show that the orbit stack of a discrete dynamical system on a simply connected manifold…
The approaches to quantum field theories based in the so called loop representation deserved much attention recently. In it, closed curves and holonomies around them play a central role. In this framework the group of loops and the group of…
We study mapping class group orbits of homotopy and isotopy classes of curves with self-intersections. We exhibit the asymptotics of the number of such orbits of curves with a bounded number of self-intersections, as the complexity of the…
Persistence diagrams (PDs), often characterized as sets of death and birth of homology class, have been known for providing a topological representation of a graph structure, which is often useful in machine learning tasks. Prior works rely…
We consider the problem of classifying trajectories on a discrete or discretised 2-dimensional manifold modelled by a simplicial complex. Previous works have proposed to project the trajectories into the harmonic eigenspace of the Hodge…
Wilson loop diagrams are an important tool in studying scattering amplitudes of SYM $N=4$ theory and are known by previous work to be associated to positroids. We characterize the conditions under which two Wilson loop diagrams give the…
Topologically ordered phases of matter display a number of unique characteristics, including ground states that can be interpreted as patterns of closed strings. In this paper, we consider the problem of detecting and distinguishing closed…
We define and study homotopy groups of cubical sets. To this end, we give four definitions of homotopy groups of a cubical set, prove that they are equivalent, and further that they agree with their topological analogues via the geometric…
Circuit topology refers to the arrangement of interactions between objects belonging to a linearly ordered object set. Linearly ordered set of objects are common in nature and occur in a wide range of applications in economics, computer…
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…
We study the topology of compact manifolds with a Lie group action for which there are only finitely many non-principal orbits, and describe the possible orbit spaces which can occur. If some non-principal orbit is singular, we show that…
We present a new algorithm for computing the first discrete homology group of a graph. By testing the algorithm on different data sets of random graphs, we find that it significantly outperforms other known algorithms.
Rough path theory provides one with the notion of signature, a graded family of tensors which characterise, up to a negligible equivalence class, and ordered stream of vector-valued data. In the last few years, use of the signature has…
We propose a theory for coupling matter fields with discrete geometry on higher-order networks, i.e. cell complexes. The key idea of the approach is to associate to a higher-order network the quantum entropy of its metric. Specifically we…
We present an algorithm to compute path homology for simple digraphs, and use it to topologically analyze various small digraphs en route to an analysis of complex temporal networks which exhibit such digraphs as underlying motifs. The…
We prove that Hausdorff limit of topological minimal sets (with finitely generated coefficient group) are topologically minimal. The key idea is to reduce the homology group on the space to the homology group on the sphere, and reduce the…
We denote the matching complex of the complete graph with $n$ vertices by $M_n$. Bouc first studied the topological properties of $M_n$ in connection with the Quillen complex. Later Bj\"{o}rner, Lov\'{a}sz, Vre\'{c}ica, and…
In this paper, we extend the definition of cohomology associated to monotone graph properties, to encompass twisted functor coefficients. We introduce oriented matchings on graphs, and focus on their (twisted) cohomology groups. We…
We generalize the concept of ascending and descending runs from permutations to rooted labelled trees and mappings, i.e., functions from the set $\{1, \dots, n\}$ into itself. A combinatorial decomposition of the corresponding functional…
In this paper we introduce a primitive path homology theory on the category of simple digraphs. On the subcategory of asymmetric digraphs, this theory coincides with the path homology theory which was introduced by Grigor'yan, Lin, Muranov,…