Search arXivSearch

arXiv · 2406.17214

Fusion inequality for quadratic cohomology

Abstract

Classical simplicial cohomology on a simplicial complex G deals with functions on simplices x in G. Quadratic cohomology deals with functions on pairs of simplices (x,y) in G x G that intersect. If K,U is a closed-open pair in G, we prove here a quadratic version of the linear fusion inequality. Additional to the quadratic cohomology of G there are five additional interaction cohomology groups. Their Betti numbers are computed from functions on pairs (x,y) of simplices that intersect. Define the Betti vector b(X) computed from pairs (x,y) in X x X with x intersected y in X a and b(X,Y) with pairs in X xY with x intersected y in K. We prove the fusion inequality b(G) <= b(K)+b(U)+b(K,U)+b(U,K)+b(U,U) for cohomology groups linking all five possible interaction cases. Counting shows f(G) = f(K)+f(U) + f(K,U)+f(U,K)+f(U,U) for the f-vectors. Super counting gives Euler-Poincare sum_k (-1)^k f_k(X)=\sum_k (-1)^k b_k(X) and sum_k (-1)^k f_k(X,Y)=sum_k (-1)^k b_k(X,Y) for X,Y in {U,K}. As in the linear case, also the proof of the quadratic fusion inequality follows from the fact that the spectra of all the involved Laplacians L(X),L(X,Y) are bounded above by the spectrum of the quadratic Hodge Laplacian L(G) of G.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Oliver Knill. 2024-06-25. Fusion inequality for quadratic cohomology. https://arxiv.org/abs/2406.17214

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO