Related papers: Differentials on graph complexes II - hairy graphs
The Lipshitz-Sarkar stable homotopy link invariant defines Steenrod squares on the Khovanov cohomology of a link. Lipshitz-Sarkar constructed an algorithm for computing the first two Steenrod squares. We develop a new algorithm which…
We introduce a new cohomology-theoretic method for classifying generic immersed curves in closed compact surfaces by using Gauss codes. This subsumes a result of J.S. Carter on classifying immersed curves in oriented compact surfaces, and…
This is preprint HAL-00429963 (2009). I describe a combinatorial construction of the cohomology classes in compactified moduli spaces of curves $\widehat{Z}_{I}\in H^{*}(\bar{\mathcal{M}}_{g,n})$ starting from the following data: an odd…
We continue our investigation of spaces of long embeddings (long embeddings are high-dimensional analogues of long knots). In previous work we showed that when the dimensions are in the stable range, the rational homology groups of these…
This article is an exposition of certain connections between the braid groups, classical homotopy groups of the 2-sphere, as well as Lie algebras attached to the descending central series of pure braid groups arising as Vassiliev invariants…
This paper is devoted to the horizontal (``characteristic'') cohomology of systems of differential equations. Recent results on computing the horizontal cohomology via the compatibility complex are generalized. New results on the Vinogradov…
We propose a new method of computing cohomology groups of spaces of knots in $\R^n$, $n \ge 3$, based on the topology of configuration spaces and two-connected graphs, and calculate all such classes of order $\le 3.$ As a byproduct we…
Biology presents many examples of planar distribution and structural networks having dense sets of closed loops. An archetype of this form of network organization is the vasculature of dicotyledonous leaves, which showcases a…
The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…
A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we…
We analytically explore the scaling properties of a general class of nested subgraphs in complex networks, which includes the $K$-core and the $K$-scaffold, among others. We name such class of subgraphs $K$-nested subgraphs due to the fact…
Recently there has been growing interest in discrete homotopies and homotopies of graphs beyond treating graphs as 1-dimensional simplicial spaces. One such type of homotopy is $\times$-homotopy. Recent work by Chih-Scull has developed a…
We show that the hairy graph complex $(HGC_{n,n},d)$ appears as an associated graded complex of the oriented graph complex $(OGC_{n+1},d)$, subject to the filtration on the number of targets, or equivalently sources, called the fixed source…
We develop a theory of covering digraphs, similar to the theory of covering spaces. By applying this theory to Cayley digraphs, we build a "bridge" between GLMY-theory and group homology theory, which helps to reduce path homology…
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
The classification of high-dimensional data defined on graphs is particularly difficult when the graph geometry is unknown. We introduce a Haar scattering transform on graphs, which computes invariant signal descriptors. It is implemented…
In this paper we develop a novel mathematical formalism for the modeling of neural information networks endowed with additional structure in the form of assignments of resources, either computational or metabolic or informational. The…
We are motivated by a conjecture of A. and S. Katok to study the smooth cohomologies of a family of Weyl chamber flows. The conjecture is a natural generalization of the Livshitz Theorem to Anosov actions by higher-rank abelian groups; it…
We propose an approach to learning with graph-structured data in the problem domain of graph classification. In particular, we present a novel type of readout operation to aggregate node features into a graph-level representation. To this…
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…