Related papers: Differentials on graph complexes II - hairy graphs
Complex braid groups are the natural generalizations of braid groups associated to arbitrary (finite) complex reflection groups. We investigate several methods for computing the homology of these groups. In particular, we get the Poincar\'e…
While heterophily has been widely studied in node-level tasks, its impact on graph-level tasks remains unclear. We present the first analysis of heterophily in graph-level learning, combining theoretical insights with empirical validation.…
We present some general results on properties of the bihamiltonian cohomologies associated to bihamiltonian structures of hydrodynamic type, and compute the third cohomology for the bihamiltonian structure of the dispersionless KdV…
In the graph node embedding problem, embedding spaces can vary significantly for different data types, leading to the need for different GNN model types. In this paper, we model the embedding update of a node feature as a Hamiltonian orbit…
It was proven by Gonz\'alez-Meneses, Manch\'on and Silvero that the extreme Khovanov homology of a link diagram is isomorphic to the reduced (co)homology of the independence simplicial complex obtained from a bipartite circle graph…
This paper presents a mathematically rigorous framework for brain-inspired representation learning founded on the interplay between persistent topological structures and cohomological flows. Neural computation is reformulated as the…
We compute the local cohomology of vector fields on a manifold. In the smooth case this recovers the diagonal cohomology studied in work of Losik, Guillemin, Fuks and others. In the holomorphic case this cohomology has recently appeared in…
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 investigate which topological spaces can be constructed as topological realisations of higher-rank graphs. We describe equivalence relations on higher-rank graphs for which the quotient is again a higher-rank graph, and show that…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence 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…
We initiate the study of classical knots through the homotopy class of the n-th evaluation map of the knot, which is the induced map on the compactified n-point configuration space. Sending a knot to its n-th evaluation map realizes the…
There exists a simplified Bar-Natan Khovanov complex for open 2-braids. The Khovanov cohomology of a knot diagram made by gluing tangles of this type is therefore often amenable to calculation. We lift this idea to the level of the…
Inspired by work of Fr\"oberg (1990), and Eagon and Reiner (1998), we define the \emph{total $k$-cut complex} of a graph $G$ to be the simplicial complex whose facets are the complements of independent sets of size $k$ in $G$. We study the…
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…
On a smooth compact Riemannian manifold without boundary, we construct a finite dimensional cohomological complex of currents that are invariant by an Axiom A flow verifying Smale's transversality assumptions. The cohomology of that complex…
The rise of graph-structured data such as social networks, regulatory networks, citation graphs, and functional brain networks, in combination with resounding success of deep learning in various applications, has brought the interest in…
We construct explicit global homotopies for differential Hochschild cochains in differential geometry, thereby upgrading the classical Hochschild-Kostant-Rosenberg map to a deformation retract. Our approach combines two key techniques: a…