相关论文: Graph Cohomologies from Arbitrary Algebras
Standard combinatorial construction, due to Kontsevich, associates to any $\ai$-algebra with an invariant inner product, an inhomogeneous class in the cohomology of the moduli spaces of Riemann surfaces with marked points. We propose an…
A standard combinatorial construction, due to Kontsevich, associates to any A-infinity algebra with an invariant inner product, an inhomogeneous class in the cohomology of the moduli spaces of Riemann surfaces with marked points. We…
We introduce a norm on the real 1-cohomology of finite 2-complexes determined by the Euler characteristics of graphs on these complexes. We also introduce twisted Alexander-Fox polynomials of groups and show that they give rise to norms on…
We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…
Motivated by Khovanov homology and relations between the Jones polynomial and graph polynomials, we construct a homology theory for embedded graphs from which the chromatic polynomial can be recovered as the Euler characteristic. For plane…
Unigraphs are graphs identifiable up to isomorphism from their degree sequences. Given a class $\mathcal{A}$ of graphs, we define the class of $\mathcal{A}$-unigraphs to be graphs identifiable from degree sequence and membership in…
Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very…
A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…
The magnitude of a graph can be thought of as an integer power series associated to a graph; Leinster introduced it using his idea of magnitude of a metric space. Here we introduce a bigraded homology theory for graphs which has the…
In this paper, we develop a diamond graph theory and apply the theory to the (co)homology of the Lie algebra generated by positive systems of the classical semi-simple Lie algebras over the field of complex numbers. As an application, we…
We develop the theory of linear algebra over a (Z_2)^n-commutative algebra (n in N), which includes the well-known super linear algebra as a special case (n=1). Examples of such graded-commutative algebras are the Clifford algebras, in…
Higher dimensional graphs can be used to colour two-dimensional geometric graphs. If G the boundary of a three dimensional graph H for example, we can refine the interior until it is colourable with 4 colours. The later goal is achieved if…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
We make explicit computations in the formal symplectic geometry of Kontsevich and determine the Euler characteristics of the three cases, namely commutative, Lie and associative ones, up to certain weights.From these, we obtain some…
Euler graphs are characterized by the simple criterion that degree of each node is even. By restricting on the cycle types yet additional intrinsic properties of Euler graphs are unveiled. For example, regularity higher than degree two is…
In this paper, we define and study (co)homology theories of a compatible associative algebra $A$. At first, we construct a new graded Lie algebra whose Maurer-Cartan elements are given by compatible associative structures. Then we define…
Let BG be a classifying variety for an exceptional simple simply connected algebraic group G. We compute the degree 3 unramified Galois cohomology of BG with values in Q/Z(2) over an arbitrary field F. Combined with a paper by Merkurjev,…
We present the Chromatic Persistence Algorithm (CPA), an event-driven method for computing persistent cohomological features of weighted graphs via graphic arrangements, a classical object in computational geometry. We establish rigorous…
We give a presentation in terms of generators and relations of the cohomology in degree zero of the Campos-Willwacher graph complexes associated to compact orientable surfaces of genus $g$. The results carry a natural Lie algebra structure,…
This paper constructs the cohomology theory for grading-restricted vertex superalgebras, generalizing Yi-Zhi Huang's cohomology theory of grading-restricted vertex algebras. To simplify the discussion, motivate the construction, and make it…