Papers
Topics
Authors
Recent
Search
2000 character limit reached

Constructing solutions of simplex equations from polygon equations

Published 14 Oct 2025 in math-ph and math.MP | (2510.12905v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 3 tweets with 4 likes about this paper.