Related papers: Differentials on graph complexes II - hairy graphs

Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…

Implementing an idea due to John Baez and James Dolan we define new invariants of Whitney stratified manifolds by considering the homotopy theory of smooth transversal maps. To each Whitney stratified manifold we assign transversal homotopy…

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 introduce the notion of a Khovanov-Floer theory. Roughly, such a theory assigns a filtered chain complex over Z/2 to a link diagram such that (1) the E_2 page of the resulting spectral sequence is naturally isomorphic to the Khovanov…

We show how the classical notions of cohomology with local coefficients, CW-complex, covering space, homeomorphism equivalence, simple homotopy equivalence, tubular neighbourhood, and spinning can be encoded on a computer and used to…

Characteristic class relations in Dolbeault cohomology follow from the existence of a holomorphic Cartan geometry (for example, a holomorphic conformal structure or a holomorphic projective connection). These relations can be calculated…

We show that the category of graphs has the structure of a 2-category with homotopy as the 2-cells. We then develop an explicit description of homotopies for finite graphs, in terms of what we call `spider moves'. We then create a category…

We construct elements of the third quandle homology groups of knot quandles, which are called the shadow fundamental classes. They play the same roles for the shadow quandle cocycle invariants of knots as the fundamental classes of knot…

A large driver of the complexity of graph learning is the interplay between structure and features. When analyzing the expressivity of graph neural networks, however, existing approaches ignore features in favor of structure, making it…

This paper introduces the notion of involution module, the first generalization of the modular decomposition of 2-structure which has a unique linear-sized decomposition tree. We derive an O(n^2) decomposition algorithm and we take…

We construct an inverse system of unstable Vassiliev spectral sequences on the spaces of plumbers' knots, which model the homotopy type of the space of long knots, and show that the limit of these sequences contains the finite type…

$Hom(G,H)$ is a polyhedral complex defined for any two undirected graphs $G$ and $H$. This construction was introduced by Lov\'asz to give lower bounds for chromatic numbers of graphs. In this paper we initiate the study of the topological…

We give a new solution of the "homotopy periods" problem, as highlighted by Sullivan, which places explicit geometrically meaningful formulae first dating back to Whitehead in the context of Quillen's formalism for rational homotopy theory…

This is the second of a series of papers which are devoted to a comprehensive theory of maps between orbifolds. In this paper, we develop a basic machinery for studying homotopy classes of such maps. It contains two parts: (1) the…

Compound graphs are networks in which vertices can be grouped into larger subsets, with these subsets capable of further grouping, resulting in a nesting that can be many levels deep. In several applications, including biological workflows,…

The idea of transversality is explored in the construction of cohomology theory associated to regularized sequences of multiple products of rational functions associated to vertex algebra cohomology of codimension one foliations on complex…

We endow the category of bialgebras over a pair of operads in distribution with a cofibrantly generated model category structure. We work in the category of chain complexes over a field of characteristic zero. We split our construction in…

We define the $k$-cut complex of a graph $G$ with vertex set $V(G)$ to be the simplicial complex whose facets are the complements of sets of size $k$ in $V(G)$ inducing disconnected subgraphs of $G$. This generalizes the Alexander dual of a…

Using a result of Vdovina, we may associate to each complete connected bipartite graph $\kappa$ a $2$-dimensional square complex, which we call a tile complex, whose link at each vertex is $\kappa$. We regard the tile complex in two…

Twisted diagrams are "diagrams" with components in different categories. Structure maps are defined using auxiliary data which consists of functors relating the various categories to each other. Prime examples of the construction are…