Structural conjecture for planar graph complexes

At least 15 years old · documented by

Let GG be a connected planar graph. A cube complex is a chain complex

C=⨁v∈{0,1}nCv,C=\bigoplus_{v\in\{0,1\}^n}C_v,

indexed by the vertices of an nn-dimensional hypercube. For a vertex vv, write ∣v∣=∑ivi|v|=\sum_i v_i and let St⁡v(C)\operatorname{St}_v(C) be its star subcomplex. Let ⟨G⟩\langle G\rangle denote the complex associated with GG, and let σ\sigma be a handle map. Structural conjecture. There exists a cube complex C=⨁v∈{0,1}nCvC=\bigoplus_{v\in\{0,1\}^n}C_v such that

⟨G⟩≃⨁v∈{0,1}n(t2q31−t2q4)∣v∣⋅Cone⁡∣v∣(St⁡v(C)→σq2St⁡v(C)).\langle G\rangle\simeq\bigoplus_{v\in\{0,1\}^n}\left(\frac{t^2q^3}{1-t^2q^4}\right)^{|v|}\cdot\operatorname{Cone}^{|v|}\Big(\operatorname{St}_v(C)\xrightarrow{\sigma}q^2\operatorname{St}_v(C)\Big).

This is intended to describe a uniform structure for the complex associated with every connected planar graph. The source gives no evidence of a resolution, so the conjecture remains open.

References

Primary source

Benjamin Cooper, Matt Hogancamp and Vyacheslav Krushkal, “SO(3) Homology of Graphs and Links”, arXiv:1012.3672 (2010).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.