Clones of pigmented words and realizations of special classes of monoids

Samuele Giraudo

arxiv: 2305.18115 · v2 · submitted 2023-05-29 · 🧮 math.CO · math.QA· math.RA

Clones of pigmented words and realizations of special classes of monoids

Samuele Giraudo This is my paper

Pith reviewed 2026-05-24 09:03 UTC · model grok-4.3

classification 🧮 math.CO math.QAmath.RA

keywords clonesmonoidspigmented wordsvarietiesleft-regular bandsregular band monoidsbounded semilatticesoperads

0 comments

The pith

A functor from monoids to clones is built by pigmenting words with monoid elements, and quotients of these clones realize varieties including left-regular bands and regular band monoids.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces a functorial construction that sends any monoid to a clone whose operations are built from words on positive integers where each letter carries an accompanying monoid element. Quotients of these pigmented-word clones are shown to produce a hierarchy whose members correspond to specific varieties of monoids. This supplies explicit clone presentations for the variety of left-regular bands, for bounded semilattices, and for regular band monoids, among others. A sympathetic reader would care because clones encode algebraic identities that permit repeated variables, thereby giving a combinatorial handle on the equational theory of these monoid classes.

Core claim

A functorial construction from the category of monoids to the category of clones is introduced. The obtained clones involve words on positive integers where letters are accompanied by elements of a monoid. By considering quotients of these structures, we construct a complete hierarchy of clones involving some families of combinatorial objects. This provides clone realizations of some known and some new special classes of monoids as among others the variety of left-regular bands, bounded semilattices, and regular band monoids.

What carries the argument

The pigmented-word clone, formed by attaching monoid elements to letters in words over positive integers, which serves as the image of the functor from monoids to clones.

If this is right

The construction supplies clone realizations for the variety of left-regular bands.
It likewise realizes bounded semilattices through quotients of pigmented-word clones.
Regular band monoids receive explicit clone presentations via the same quotient process.
A complete hierarchy of clones is obtained that incorporates families of combinatorial objects.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same pigmented-word construction could be applied to additional monoid varieties beyond those explicitly treated.
The hierarchy may furnish a uniform combinatorial model for studying equational classes that lie between semilattices and bands.
Because the base objects are words, the approach may interact with existing combinatorial enumeration techniques for the free objects in these varieties.

Load-bearing premise

The quotients of the pigmented-word clones preserve the clone axioms and correctly realize the target monoid varieties without additional restrictions on the monoids or the words.

What would settle it

A monoid belonging to one of the claimed varieties (for instance a left-regular band) whose corresponding quotient fails to satisfy the clone identities that define that variety.

Figures

Figures reproduced from arXiv: 2305.18115 by Samuele Giraudo.

read the original abstract

Clones are specializations of operads forming powerful instruments to describe varieties of algebras wherein repeating variables are allowed in their equations. They allow us in this way to realize and study a large range of algebraic structures. A functorial construction from the category of monoids to the category of clones is introduced. The obtained clones involve words on positive integers where letters are accompanied by elements of a monoid. By considering quotients of these structures, we construct a complete hierarchy of clones involving some families of combinatorial objects. This provides clone realizations of some known and some new special classes of monoids as among others the variety of left-regular bands, bounded semilattices, and regular band monoids.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper builds clones from monoids via pigmented words and quotients to realize left-regular bands and similar varieties, but the value hinges on whether the proofs actually verify the clone axioms and the realizations.

read the letter

The core contribution is a functorial construction that turns a monoid into a clone whose elements are words on positive integers tagged with monoid elements, followed by quotients that produce a hierarchy realizing left-regular bands, bounded semilattices, and regular band monoids. This gives explicit clone presentations for those classes, which is the main new piece beyond what was already known for some of them. The approach looks systematic on the surface and could be handy for anyone already working with clones or operads in combinatorial algebra. It avoids obvious circularity and presents the hierarchy as complete for the families it targets. The main limitation is that the abstract supplies no definitions, no verification that the quotients preserve the clone operations, and no sample calculations, so soundness cannot be checked from the given text. If the full paper contains the missing steps and they hold, the construction is solid enough for its niche; if they rely on unstated restrictions, the realizations may not be as general as claimed. This is narrow-scope work aimed at specialists in monoid varieties and clone theory rather than a broad audience. A reader already following that literature might find the explicit realizations useful for further calculations. I would send it to peer review because the construction is concrete and the claims are falsifiable once the proofs are examined, even though the overall reach stays modest.

Referee Report

1 major / 0 minor

Summary. The paper introduces a functorial construction from the category of monoids to the category of clones via pigmented words (words on positive integers accompanied by monoid elements). By taking quotients of these clones, it constructs a hierarchy realizing special classes of monoids including left-regular bands, bounded semilattices, and regular band monoids.

Significance. If verified, the construction would supply a systematic combinatorial realization of monoid varieties inside the clone category, potentially unifying aspects of universal algebra with word combinatorics and providing a hierarchy for further study of varieties allowing repeated variables.

major comments (1)

The abstract asserts that the functorial map and subsequent quotients succeed in realizing the listed monoid varieties while preserving clone structure, but the provided text contains no definitions of pigmented words, no explicit functor, no quotient construction, and no verification that the quotient operations satisfy the clone axioms or correctly map onto the target varieties. This renders the central claims unverifiable.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their report. We address the single major comment below and agree that the submitted manuscript requires revision to supply the missing technical content.

read point-by-point responses

Referee: The abstract asserts that the functorial map and subsequent quotients succeed in realizing the listed monoid varieties while preserving clone structure, but the provided text contains no definitions of pigmented words, no explicit functor, no quotient construction, and no verification that the quotient operations satisfy the clone axioms or correctly map onto the target varieties. This renders the central claims unverifiable.

Authors: We agree that the manuscript as submitted contains no definitions of pigmented words, no explicit functor from monoids to clones, no description of the quotient construction, and no verification that the resulting operations satisfy the clone axioms or realize the claimed varieties (left-regular bands, bounded semilattices, regular band monoids, etc.). These omissions render the central claims unverifiable from the text. We will revise the manuscript to include complete definitions, the functor, the quotient maps, and the necessary verifications that the structures are clones and that the quotients realize the target monoid varieties. revision: yes

Circularity Check

0 steps flagged

No significant circularity; direct functorial construction

full rationale

The paper defines a functor from monoids to clones via pigmented words on positive integers, then takes quotients to obtain realizations of monoid varieties (left-regular bands, bounded semilattices, regular band monoids). No equations equate a derived object to its own input by definition, no parameters are fitted and relabeled as predictions, and no load-bearing uniqueness theorems or ansatzes are imported via self-citation. The central claims rest on explicit algebraic constructions that are independent of the target results. This is the expected non-finding for a pure-mathematics paper presenting a new functor and hierarchy.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The abstract relies on standard definitions of monoids, clones as operad specializations, categories, and quotients; no free parameters, invented entities, or ad-hoc axioms are mentioned.

axioms (2)

domain assumption Clones are specializations of operads allowing repeated variables in equations
Stated in the opening sentence of the abstract.
domain assumption There exists a functorial construction from the category of monoids to clones
Central claim of the abstract.

pith-pipeline@v0.9.0 · 5640 in / 1248 out tokens · 23229 ms · 2026-05-24T09:03:00.828206+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

6 extracted references · 6 canonical work pages

[1]

p′ /leadstop.i e 2ie

work page
[2]

p′ if i2 < i 1, (4.3.3.H) p. (ie)k+1. p′ /leadstop. (ie)k. p′, (4.3.3.I) where p, p′ ∈ P(E) and ie, i e 1, i e 2 ∈ L E . Let ∼ be the reﬂexive, symmetric, and transitive closure of /leadstoand let us show that ∼ is equal to ≡ φ k . First, observe that directly from the deﬁnition of Clones of pigmented words 23 / 41 S. Giraudo 5 A HIERARCHY OF CLONES — /le...

work page
[3]

p′ = 1 e2e3e[p, 1e2e[ie 1, i e 2], p′] ≡ ′ 1e2e3e[p, 2e1e[ie 1, i e 2], p′] = p.i e 2ie

work page
[4]

p′ (4.3.3.J) and p. (ie)kie. p′ = 1 e2e3e [ p, (1e)k1e[ie], p′ ] ≡ ′ 1e2e3e [ p, (1e)k[ie], p′ ] = p. (ie)k. p′. (4.3.3.K) This shows that for any r, r′ ∈ P(E), r /leadstor′ implies r ≡ ′ r′. Since ∼ is the smallest equivalence relation containing /leadsto, ∼ is contained into ≡ ′. This establishes the statement of the proposition. □□□ By Proposition 4.3....

work page
[5]

, pk, p′ k,

i α sk sk where p1, . . . , pk, p′ k, . . . , p′ 1 ∈ P(M). Hence, p. p = i α r1 r1 . p1. . . . . i α rk rk . pk. p′ k. i α s1 s1 . . . . . p′

work page
[6]

stalactic congruence

i α sk sk , (5.1.2.H) and since the positions in p. p of the letters of its factors p1, . . . , pk, p′ k, . . . , p′ 1 are neither left 1-witnesses nor right 1-witnesses, we have p. p /leadsto1 . . . /leadsto1 i α r1 r1 . . . i α rk rk i α s1 s1 . . . i α sk sk = ﬁrst1(p). ﬁrstr 1(p). (5.1.2.I) By putting these ∼ -equivalences together, we obtain p ∼ p. p...

work page arXiv 2010

[1] [1]

p′ /leadstop.i e 2ie

work page

[2] [2]

p′ if i2 < i 1, (4.3.3.H) p. (ie)k+1. p′ /leadstop. (ie)k. p′, (4.3.3.I) where p, p′ ∈ P(E) and ie, i e 1, i e 2 ∈ L E . Let ∼ be the reﬂexive, symmetric, and transitive closure of /leadstoand let us show that ∼ is equal to ≡ φ k . First, observe that directly from the deﬁnition of Clones of pigmented words 23 / 41 S. Giraudo 5 A HIERARCHY OF CLONES — /le...

work page

[3] [3]

p′ = 1 e2e3e[p, 1e2e[ie 1, i e 2], p′] ≡ ′ 1e2e3e[p, 2e1e[ie 1, i e 2], p′] = p.i e 2ie

work page

[4] [4]

p′ (4.3.3.J) and p. (ie)kie. p′ = 1 e2e3e [ p, (1e)k1e[ie], p′ ] ≡ ′ 1e2e3e [ p, (1e)k[ie], p′ ] = p. (ie)k. p′. (4.3.3.K) This shows that for any r, r′ ∈ P(E), r /leadstor′ implies r ≡ ′ r′. Since ∼ is the smallest equivalence relation containing /leadsto, ∼ is contained into ≡ ′. This establishes the statement of the proposition. □□□ By Proposition 4.3....

work page

[5] [5]

, pk, p′ k,

i α sk sk where p1, . . . , pk, p′ k, . . . , p′ 1 ∈ P(M). Hence, p. p = i α r1 r1 . p1. . . . . i α rk rk . pk. p′ k. i α s1 s1 . . . . . p′

work page

[6] [6]

stalactic congruence

i α sk sk , (5.1.2.H) and since the positions in p. p of the letters of its factors p1, . . . , pk, p′ k, . . . , p′ 1 are neither left 1-witnesses nor right 1-witnesses, we have p. p /leadsto1 . . . /leadsto1 i α r1 r1 . . . i α rk rk i α s1 s1 . . . i α sk sk = ﬁrst1(p). ﬁrstr 1(p). (5.1.2.I) By putting these ∼ -equivalences together, we obtain p ∼ p. p...

work page arXiv 2010