2000 character limit reached
Representation gaps of rigid planar diagram monoids (2505.05846v1)
Published 9 May 2025 in math.RT, cs.CR, math.GR, and math.QA
Abstract: We define non-pivotal analogs of the Temperley-Lieb, Motzkin, and planar rook monoids, and compute bounds for the sizes of their nontrivial simple representations. From this, we assess the two types of monoids in their relative suitability for use in cryptography by comparing their representation gaps and gap ratios. We conclude that the non-pivotal monoids are generally worse for cryptographic purposes.
