Search arXivSearch

arXiv · 1803.06788

The Cohomology for Wu Characteristics

Abstract

While Euler characteristic X(G)=sum_x w(x) super counts simplices, Wu characteristics w_k(G) = sum_(x_1,x_2,...,x_k) w(x_1)...w(x_k) super counts simultaneously pairwise interacting k-tuples of simplices in a finite abstract simplicial complex G. More general is the k-intersection number w_k(G_1,...G_k), where x_i in G_i. We define interaction cohomology H^p(G_1,...,G_k) compatible with w_k and invariant under Barycentric subdivison. It allows to distinguish spaces which simplicial cohomology can not: it can identify algebraically the Moebius strip and the cylinder for example. The cohomology satisfies the Kuenneth formula: the Poincare polynomials p_k(t) are ring homomorphisms from the strong ring to the ring of polynomials in t. The Dirac operator D=d+d^* defines the block diagonal Hodge Laplacian L=D^2 which leads to the generalized Hodge correspondence b_p(G)=dim(H^p_k(G)) = dim(ker(L_p)) and Euler-Poincare w_k(G)=sum_p (-1)^p dim(H^p_k(G)) for Wu characteristic. Also, like for traditional simplicial cohomology, isospectral Lax deformation D' = [B(D),D], with B(t)=d(t)-d^*(t)-ib(t), D(t)=d(t)+d(t)^* + b(t) can deform the exterior derivative d. The Brouwer-Lefschetz fixed point theorem generalizes to all Wu characteristics: given an endomorphism T of G, the super trace of its induced map on k'th cohomology defines a Lefschetz number L_k(T). The Brouwer index i_T,k(x_1,...,x_k) = product_j=1^k w(x_j) sign(T|x_j) attached to simplex tuple which is invariant under T leads to the formula L_k(T) = sum_T(x)=x i_T,k(x). For T=Id, the Lefschetz number L_k(Id) is equal to the k'th Wu characteristic w_k(G) of the graph G and the Lefschetz formula reduces to the Euler-Poincare formula for Wu characteristic.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Oliver Knill. 2018-03-19. The Cohomology for Wu Characteristics. https://arxiv.org/abs/1803.06788

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO