SearcharxivSearch

arXiv · 2405.20406

Bijective solutions to the Pentagon Equation

Abstract

A complete classification of all finite bijective set-theoretic solutions $(S,s)$ to the Pentagon Equation is obtained. First, it is shown that every such solution determines a semigroup structure on the set $S$ that is the direct product $E\times G$ of a semigroup of left zeros $E$ and a group $G$. Next, we prove that this leads to a decomposition of the set $S$ as a Cartesian product $X\times A\times G$, for some sets $X,A$ and to the discovery of a hidden group structure on $A$. Then an unexpected structure of a matched product of groups $A,G$ is found such that the solution $(S,s)$ can be explicitly described as a lift of a solution determined on the set $A\times G$ by this matched product of groups. Conversely, every matched product of groups leads to a family of solutions arising in this way. Moreover, a simple criterion for the isomorphism of two solutions is obtained. These results significantly extend those of Colazzo, Jespers, and Kubat, in their treatment of the involutive case. Furthermore, connections to solutions to the Yang--Baxter Equation and to the theory of skew braces are uncovered. The latter motivate a further investigation of the relationship between solutions to the Yang--Baxter Equation and the Pentagon Equation at the set-theoretical level.

Explore related subjects

Keep this discovery

BibTeXRIS

I. Colazzo, J. Okniński, A. Van Antwerpen. 2024-05-30. Bijective solutions to the Pentagon Equation. https://arxiv.org/abs/2405.20406

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR