2000 character limit reached
Constructing solutions of simplex equations from polygon equations (2510.12905v1)
Published 14 Oct 2025 in math-ph and math.MP
Abstract: We study polygon equations and their connections to simplex equations, which generalize the pentagon and Yang--Baxter equations, respectively. First, we show that certain "commutative" pairs of solutions of (dual) polygon equations give rise to solutions of higher polygon equations. Next, we define an explicit compatibility condition between solutions of the $n$-gon and dual $n$-gon equations and use it to construct solutions of the $(n-2)$- and $(n-1)$-simplex equations. This extends earlier work by Kashaev--Sergeev and Dimakis--H\"uller-Hoissen.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.