Infinitesimal Dilogarithm Satisfies Cluster Identities
Number Theory
2025-10-02 v1 K-Theory and Homology
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.
Cite
@article{arxiv.2510.00016,
title = {Infinitesimal Dilogarithm Satisfies Cluster Identities},
author = {Sinan Unver},
journal= {arXiv preprint arXiv:2510.00016},
year = {2025}
}