paper

Almost complex structure on finite points from bidirected graphs

arXiv:2311.11034 · doi:10.4171/JNCG/577

Abstract

We show that there is an almost complex structure on a differential calculus on finite points coming from a bidirected finite graph without multiple edges or loops. We concentrate on a polygon as a concrete case. In particular, a `holomorphic structure on the exterior bundle' built from the polygon is studied. Also a positive Hochschild 2-cocycle on the vertex set of the polygon, albeit a trivial one, is shown to arise naturally from the almost complex structure.

25 pages

Almost complex structure on finite points from bidirected graphs · wovepaper