相关论文: Graph Cohomologies from Arbitrary Algebras
In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…
We define degree two cohomological invariants for G-Galois algebras over fields of characteristic not 2, and use them to give necessary conditions for the existence of a self--dual normal basis. In some cases, we show that these conditions…
In this paper, we introduce a class of graphs which we call average hereditary graphs. Many graphs that occur in the usual graph theory applications belong to this class of graphs. Many popular types of graphs fall under this class, such as…
We review the gauge and ghost cyle graph complexes as defined by Kreimer, Sars and van Suijlekom in "Quantization of gauge fields, graph polynomials and graph homology" and compute their cohomology. These complexes are generated by…
A coloured graph is k-ultrahomogeneous if every isomorphism between two induced subgraphs of order at most k extends to an automorphism. A coloured graph is t-tuple regular if the number of vertices adjacent to every vertex in a set S of…
A graph coloring has bounded clustering if each monochromatic component has bounded size. This paper studies such a coloring, where the number of colors depends on an excluded complete bipartite subgraph. This is a much weaker assumption…
In this article we associate a combinatorial differential graded algebra to a cubic planar graph G. This algebra is defined combinatorially by counting binary sequences, which we introduce, and several explicit computations are provided. In…
A functor from the category of directed trees with inclusions to the category of commutative C*-algebras with injective *-homomorphisms is constructed. This is used to define a functor from the category of directed graphs with inclusions to…
We define the categorical cohomology of a k-graph \Lambda\ and show that the first three terms in this cohomology are isomorphic to the corresponding terms in the cohomology defined in our previous paper. This leads to an alternative…
Following our previous works on $C^*$-graph algebras and the associated Cuntz-Krieger graph families, in this paper we will try to have a look at the colored version of these structures and to see what a $C^*$-colored graph algebra might…
In this article, we focus on the characteristic polynomial of a graph containingloops, but without multiple edges. We present a relationship between thecharacteristic polynomial of a graph with loops and the graph obtained byremoving all…
To a graph $\Gamma$, one can associate a hypertoric variety $\mathcal{M}(\Gamma)$ and its multiplicative version $\mathcal{M}^{\mathrm{mul}}(\Gamma)$. It was shown in [DMS24] that the cohomology of $\mathcal{M}^{\mathrm{mul}}(\Gamma)$ is…
This article concerns commutative algebras over a field $k$ of characteristic zero which are finite dimensional as vectorspaces, and particularly those of such algebras which are graded. Here the term graded is applied to non-negatively…
We give a conceptual formulation of Kontsevich's `dual construction' producing graph cohomology classes from a differential graded Frobenius algebra with an odd scalar product. Our construction -- whilst equivalent to the original one -- is…
Motivated by applications in the medical sciences, we study finite chromatic sets in Euclidean space from a topological perspective. Based on the persistent homology for images, kernels and cokernels, we design provably stable homological…
It is proved that the associative differential graded algebra of (polynomial) polyvector fields on a vector space (may be infinite- dimensional) is quasi-isomorphic to the corresponding cohomological Hochschild complex of (polynomial)…
A suitable extra differential on graph complexes can lead to a pairing of its cohomological classes. Many such extra differentials are known for various graph complexes, including Kontsevich's graph complex $GC_n$ for odd $n$. In this paper…
The complexity of graph homomorphisms has been a subject of intense study [11, 12, 4, 42, 21, 17, 6, 20]. The partition function $Z_{\mathbf A}(\cdot)$ of graph homomorphism is defined by a symmetric matrix $\mathbf A$ over $\mathbb C$. We…
In this short note, we show that the cohomology of an algebra entwined with a coalgebra as defined by T. Brzezi\'nski (J. Algebra 235 (2001), no. 1, 176--202; arXiv:math.RA/9909108) computes the Hochschild cohomology of the subalgebra of…
A 2-edge-colored graph or a signed graph is a simple graph with two types of edges. A homomorphism from a 2-edge-colored graph $G$ to a 2-edge-colored graph $H$ is a mapping $\varphi: V(G) \rightarrow V(H)$ that maps every edge in $G$ to an…