相关论文: Fatgraph Algorithms and the Homology of the Kontse…

We study the homology of an explicit finite-index subgroup of the automorphism group of a partially commutative group, in the case when its defining graph is a tree. More concretely, we give a lower bound on the first Betti number of this…

The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle…

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

In this paper we introduce the concept of characteristic number that are proven to be useful in the study of the combinatorics of graph cohomology. We claim that it is a good combinatorial counterpart for geometric Betti numbers. We then…

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…

We compute the homology of the matching complex $M(\Gamma)$, where $\Gamma$ is the complete hypergraph on $n\geq 2$ vertices, and analyse the $S_n$-representations carried by this homology. These results are achieved using standard…

We determine all possible triples of depth, dimension, and regularity of edge ideals of weighted oriented graphs with a fixed number of vertices. Also, we compute all the possible Betti table sizes of edge ideals of weighted oriented trees…

Topological data analysis has emerged as a powerful tool for analyzing large-scale data. An abstract simplicial complex, in principle, can be built from data points, and by using tools from homology, topological features could be…

We introduce an invariant for trivalent fatgraph spines of a once bordered surface, which takes values in the first homology of the surface. This invariant is the secondary object coming from two 1-cocycles on the dual fatgraph complex, one…

A geometric entropy is defined as the Riemannian volume of the parameter space of a statistical manifold associated with a given network. As such it can be a good candidate for measuring networks complexity. Here we investigate its ability…

To a matroid M with n edges, we associate the so-called facet ideal F(M) generated by monomials corresponding to bases of M. We show that the Betti numbers related to an N-graded minimal free resolution of F(M) are determined by the Betti…

A multicomplex structure is defined from an ordered lattice of multigraphs. This structure will help us to observe the features of Persistent Homology in this context, its interaction with the ordering and the repercussions of the process…

Developing an algorithm for computing the Betti numbers of semi-algebraic sets with singly exponential complexity has been a holy grail in algorithmic semi-algebraic geometry and only partial results are known. In this paper we consider the…

We suggest a general method of computation of the homology of certain smooth covers $\hat{\mathcal{M}}_{g,1}(\mathbb{C})$ of moduli spaces $\mathcal{M}_{g,1}\br{\mathbb{C}}$ of pointed curves of genus $g$. Namely, we consider moduli spaces…

We will provide bounds on both the Betti numbers and the torsion part of the homology of hyperbolic orbifolds. These bounds are linear in the volume and are a direct consequence of an efficient simplicial model of the thick part, which we…

Given any (not necessarily connected) combinatorial finite graph and any compact smooth $6$-manifold $M^6$ with the third Betti number $b_3\not=0$, we construct a calibrated 3-dimensional homologically area minimizing surface on $M$…

We present a distributed algorithm to compute the first homology of a simplicial complex. Such algorithms are very useful in topological analysis of sensor networks, such as its coverage properties. We employ spanning trees to compute a…

The homology of Kontsevich's commutative graph complex parameterizes finite type invariants of odd dimensional manifolds. This {\it graph homology} is also the twisted homology of Outer Space modulo its boundary, so gives a nice point of…

Our goal is to describe superconformal structures on super Riemann surfaces (SRS), based on data assigned to a fatgraph. We start from the complex structures on punctured $(1|1)$-supermanifolds, characterizing the corresponding moduli and…

By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…