2000 character limit reached
Identities of the stylic monoid
Published 18 Jun 2022 in math.GR | (2206.09129v1)
Abstract: We observe that for each $n\ge 2$, the identities of the stylic monoid with $n$ generators coincide with the identities of $n$-generated monoids from other distinguished series of $\mathscr{J}$-trivial monoids studied in the literature, e.g., Catalan monoids and Kiselman monoids. This solves the Finite Basis Problem for stylic monoids.
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.