arXiv · 2510.00016
Infinitesimal Dilogarithm Satisfies Cluster Identities
Abstract
In this paper, we show that the infinitesimal dilogarithm and Kontsevich's one-and-a-half logarithm function satisfies the identities which result from periods in cluster patterns. We also prove that these cluster identities are a consequence of the pentagon relation in the infinitesimal case.
Explore related subjects
Keep this discovery
Sinan Unver. 2025-09-19. Infinitesimal Dilogarithm Satisfies Cluster Identities. https://arxiv.org/abs/2510.00016
Cite the original work for its findings. Save a collection to share your selection of sources.