The graph-generalized Orlik–Terao conjecture

About 10 years old · traced to

Let Γ\Gamma be a simple connected graph with vertex set [n][n], let Aut⁡(Γ)⊂Sn\operatorname{Aut}(\Gamma)\subset S_n be its automorphism group, and let OTΓOT_\Gamma be the Orlik–Terao algebra of the associated graphic arrangement. Define

MΓ:=OTΓ⊗RnC.M_\Gamma:=OT_\Gamma\otimes_{R_n}\mathbb{C}.

Let DΓ:=H∗(Conf⁡(Γ,G)/G;C)D_\Gamma:=H^*(\operatorname{Conf}(\Gamma,G)/G;\mathbb{C}), where GG is the group used in the source, and let Γ^\hat{\Gamma} be the cone over Γ\Gamma; write CΓ:=H∗(Conf⁡(Γ,R3))C_\Gamma:=H^*(\operatorname{Conf}(\Gamma,\mathbb{R}^3)).

The graph-generalized Orlik–Terao conjecture. For any simple connected graph Γ\Gamma, there exists an isomorphism

MΓ≅DΓM_\Gamma\cong D_\Gamma

of graded representations of Aut⁡(Γ)\operatorname{Aut}(\Gamma). In particular, there exists an isomorphism

Res⁡Aut⁡(Γ)Aut⁡(Γ^)(MΓ^)≅CΓ.\operatorname{Res}^{\operatorname{Aut}(\hat{\Gamma})}_{\operatorname{Aut}(\Gamma)}(M_{\hat{\Gamma}})\cong C_\Gamma.

This extends the main conjecture from complete graphs to graphic arrangements and configuration spaces associated with arbitrary simple connected graphs. The source gives no resolution.

References

Primary source

Daniel Moseley, Nicholas Proudfoot and Ben Young, “The Orlik-Terao algebra and the cohomology of configuration space”, arXiv:1603.01189 (2016).

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.