相关论文: Graph Cohomologies from Arbitrary Algebras

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…

Phil Hanlon proved that the coefficients of the chromatic polynomial of a graph G are equal (up to sign) to the dimensions of the summands in a Hodge-type decomposition of the top homology of the coloring complex for G. We prove a type B…

We study the cohomology of complexes of ordinary (non-decorated) graphs, introduced by M. Kontsevich. We construct spectral sequences converging to zero whose first page contains the graph cohomology. In particular, these series may be used…

We compute the factorization homology of a polynomial algebra over a compact and closed manifold with trivialized tangent bundle up to weak equivalence in a new way. This calculation is based on the model of a graph complex and an explicit…

We study the chromatic number of the curve graph of a surface. We show that the chromatic number grows like k log k for the graph of separating curves on a surface of Euler characteristic -k. We also show that the graph of curves that…

We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…

Let $\mathcal{A}$ be a connected cochain DG algebra such that its underlying graded algebra $\mathcal{A}^{\#}$ is the graded skew polynomial algebra $$k\langle x_1,x_2, x_3\rangle/\left(\begin{array}{ccc} x_1x_2+x_2x_1\\ x_2x_3+x_3x_2\\…

We compute the sheaf cohomology of a groupoid built from a local homeomorphism of a locally compact space $X$. In particular, we identify the twists over this groupoid, and its Brauer group. Our calculations refine those made by Kumjian,…

We define and study a bigraded knot invariant whose Euler characteristic is the Alexander polynomial, closely connected to knot Floer homology. The invariant is the homology of a chain complex whose generators correspond to Kauffman states…

The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that $k$-colorability of a graph $G$ is equivalent to the condition $1 \in…

We extend the theory of combinatorial link Floer homology to a class of oriented spatial graphs called transverse spatial graphs. To do this, we define the notion of a grid diagram representing a transverse spatial graph, which we call a…

For any type of fundamental groupoid scheme, we construct an algebraic cohomology theory for varieties with coefficients in the base field. This is a minor variant of \'etale cohomology, involving neither de Rham complexes nor…

A characterization is given for directed graphs that yield graph $C^*$-algebras with continuous trace. This is established for row-finite graphs with no sources first using a groupoid approach, and extended to the general case via the…

We associate to each synchronous game an algebra whose representations determine if the game has a perfect deterministic strategy, perfect quantum strategy or one of several other perfect strategies. when applied to the graph coloring game,…

We prove that, if $A$ is a positively graded, graded commutative, local, finite Hopf algebra, its cohomology is finitely generated, thus unifying classical results of Wilkerson and Hopkins-Smith, and of Friedlander-Suslin. We do this by…

The goal of this paper is to present results which are consistent with conjectures about the Leibniz (co)homology for discrete groups stated by J. L. Loday. We show that rack cohomology has properties very close to the properties expected…

Let us consider a polynomial algebra in three variables equipped with an integer grading. We construct a system of group-generating automorphisms that preserve a given grading.

A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…

Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…

A \emph{mixed graph} is a graph with directed edges, called arcs, and undirected edges. A $k$-coloring of the vertices is proper if colors from ${1,2,...,k}$ are assigned to each vertex such that $u$ and $v$ have different colors if $uv$ is…