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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.