Almost complex structure on finite points from bidirected graphs

  • Soumalya Joardar

    Indian Institute of Science Education and Research Kolkata, Mohanpur, West Bengal, India
  • Atibur Rahaman

    Indian Institute of Science Education and Research Kolkata, Mohanpur, West Bengal, India
Almost complex structure on finite points from bidirected graphs cover

A subscription is required to access this article.

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.

Cite this article

Soumalya Joardar, Atibur Rahaman, Almost complex structure on finite points from bidirected graphs. J. Noncommut. Geom. (2024), published online first

DOI 10.4171/JNCG/577