Related papers: Complexes of marked graphs in gauge theory

In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…

Hypergraphs are mathematical models for many problems in data sciences. In recent decades, the topological properties of hypergraphs have been studied and various kinds of (co)homologies have been constructed (cf. [3, 4, 12]). In this…

For positive integers k,n, we investigate the simplicial complex NM_k(n) of all graphs G on vertex set [n] such that every matching in G has size less than k. This complex (along with other associated cell complexes) is found to be homotopy…

For each graph, we construct a bigraded chain complex whose graded Euler characteristic is a version of the Tutte polynomial. This work is motivated by earlier work of Khovanov, Helme-Guizon and Rong, and others.

We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their…

By using the cohomology theory of quandles, quandle cocycle invariants and shadow quandle cocycle invariants are defined for oriented links and surface-links via broken surface diagrams. By using symmetric quandles, symmetric quandle…

In this paper we study the homology and cohomology of confguration spaces of two distinct particles on a graph. Our main tool is intersection theory for cycles in graphs. We obtain an explicit description of the cohomology algebra of the…

We prove that the inclusion from oriented graph complex into graph complex with at least one source is a quasi-isomorphism, showing that homology of the "sourced" graph complex is also equal to the homology of standard Kontsevich's graph…

We formulate the notion of an isomorphism of GKM graphs. We then show that two GKM graphs have isomorphic graph equivariant cohomology algebras if and only if the graphs are isomorphic.

The family of cycle completable graphs has several cryptomorphic descriptions, the equivalence of which has heretofore been proven by a laborious implication-cycle that detours through a motivating matrix completion problem. We give a…

By considering graphs as discrete analogues of Riemann surfaces, Baker and Norine (Adv. Math. 2007) developed a concept of linear systems of divisors for graphs. Building on this idea, a concept of gonality for graphs has been defined and…

In this article, we give a characterisation of crossed homomorphisms on Lie superalgebras as a Maurer-Cartan element of a graded Lie algebra. Using this characterisation we study cohomology of these crossed homomorphisms. As an application…

Let $S$ denote the graded polynomial ring $\C[x_1,...,x_m]$. We interpret a chain complex of free $S$-modules having finite length homology modules as an $S^1$-equivariant map $\C^m\sm\{0\} \to X$, where $X$ is a moduli space of exact…

In "Generalized Group Characters and Complex Oriented Cohomology Theories", Hopkins, Kuhn, and Ravenel develop a way to study cohomology rings of the form E^*(BG) in terms of a character map. The character map can be interpreted as a map of…

In two seminal papers Kontsevich used a construction called_graph homology_ as a bridge between certain infinite dimensional Lie algebras and various topological objects, including moduli spaces of curves, the group of outer automorphisms…

For a positive integer $k$, the \emph{ total $k$-cut complex} of a graph $G$, denoted as $\Delta_k^t(G)$, is the simplicial complex whose facets are $\sigma \subseteq V(G)$ such that $|\sigma| = |V(G)|-k$ and the induced subgraph $G[V(G)…

We examine the topological characteristic cohomology classes of complexified vector bundles. In particular, all the classes coming from the real vector bundles underlying the complexification are determined.

All Cayley representations of the distant graph $\Gamma _Z$ over integers are characterized as Neumann subgroups of the extended modular group. Possible structures of Neumann subgroups are revealed and it is shown that every such a…

Series-parallel network topologies generally exhibit simplified dynamical behavior and avoid high combinatorial complexity. A comprehensive analysis of how flow complexity emerges with a graph's deviation from series-parallel topology is…

Motivated by the problem of deformation quantization we introduce and study directed graph complexes with oriented loops and wheels. We develop some technique for computing cohomology of such graph complexes and apply it to several concrete…