Related papers: Differentials on graph complexes
We introduce Hochschild (co-)homology of morphisms of schemes or analytic spaces and study its fundamental properties. In analogy with the cotangent complex we introduce the so called (derived) Hochschild complex of a morphism; the…
We examine the slice spectral sequence for the cohomology of singular schemes with respect to various motivic T-spectra, especially the motivic cobordism spectrum. When the base field k admits resolution of singularities and X is a scheme…
We introduce a persistent Hochschild homology framework for directed graphs. Hochschild homology groups of (path algebras of) directed graphs vanish in degree $i\geq 2$. To extend them to higher degrees, we introduce the notion of…
The degree sequence of a graph is a numerical method to characterize the properties of graphs. Generalized forms of degree sequences exist for complete graphs and complete graphs. Nikolopolus et al. characterized the number of spanning…
We investigate a notion of $\times$-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph $\times$-homotopy is characterized by the topological…
We provide a generating function for the (graded) dimensions of M. Kontsevich's graph complexes of ordinary graphs. This generating function can be used to compute the Euler characteristic in each loop order. Furthermore, we show that…
We show that the discrete versions of the systolic inequality that estimate the number of vertices of a simplicial complex from below have substantial applications to graphs, the one-dimensional simplicial complexes. Almost directly they…
We study sheaves of differential forms and their cohomology in the h-topology. This allows to extend standard results from the case of smooth varieties to the general case. As a first application we explain the case of singularities arising…
The notion of a contractible transformation on a graph was introduced by Ivashchenko as a means to study molecular spaces arising from digital topology and computer image analysis, and more recently has been applied to topological data…
Two graphs having the same spectrum are said to be cospectral. A pair of singularly cospectral graphs is formed by two graphs such that the absolute values of their nonzero eigenvalues coincide. Clearly, a pair of cospectral graphs is also…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
In this paper we construct various non-trivial and non-tautological cohomology classes on compactified and uncompactified strata of curves with a differential, by using the geometry of the boundary stratification of the moduli space of…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…
Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…
We introduce techniques of Suslin, Voevodsky, and others into the study of singular varieties. Our approach is modeled after Goresky-MacPherson intersection homology. We provide a formulation of perversity cycle spaces leading to perversity…
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…
Our aim in this paper is to investigate the first Hochschild cohomology of {\em admissible algebras} which can be seen as a generalization of basic algebras. For this purpose, we study differential operators on an admissible algebra.…
Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide…