REVIEW 3 major objections 4 minor 52 references
Cayley posets
T0 review · 3 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read A poset arises from a finitely generated pointed submonoid of an abelian group exactly when it is auto-equivalent, locally finite, and has finitely many atoms.
desk verdict A genuinely useful unifying framework for posets from semigroups, with a clean headline characterization that is probably correct but currently leans on a deferred proof the authors should make explicit. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing mechanism is the auto-equivalence structure plus the atom-kernel construction. Given the atom set A of a locally finite auto-equivalent poset, the paper defines a map f from the free commutative monoid N^A to P by f(0)=e and f(α+e_a)=φ_a(f(α)), then forms the subgroup L_P of differences α−β in Z^A with f(α)=f(β). The quotient G=Z^A/L_P is an abelian group and M=N^A/L_P is the desired pointed submonoid; the map ψ(x)=Σ α(a)e_a, where f(α)=x, is an order isomorphism. The supporting endomorphism-monoid characterizations (Theorems 2.4 and 2.6) are what link these translations to the order structure: they identify when a poset admits a semigroup or monoid of order endomorphisms whose elements send a fixed upset onto every principal upset.
What would settle it
Run the Lemma 6.2 construction on a locally finite, auto-equivalent poset with finitely many atoms and check whether M=N^A/L_P is pointed: any invertible element of M other than the identity would directly contradict Theorem 6.3. The lexicographic poset of Proposition 6.4 is a useful test case, since it is auto-equivalent with one atom but not group-embeddable; the failure there is the infinite interval [(0,0),(1,0)], so an analogous example that remains locally finite would be decisive.
Extended reading notes
Core claim
The paper's central claim is Theorem 6.3. It states that a poset P is isomorphic to P(M,M), the Cayley poset of a finitely generated pointed submonoid M of an abelian group, if and only if P is auto-equivalent, locally finite, and has finitely many atoms. Auto-equivalence means P has a global minimum and carries a commutative submonoid T of its order-endomorphism monoid such that for every x there is a unique φ_x in T with φ_x(P)=↑x and φ_x an order isomorphism from P onto its principal upset. The forward direction follows because translation by elements of such an M realizes exactly this structure, and the reverse direction constructs M from the poset's atoms: the free abelian group on the atoms is divided by the subgroup of relations that identify translations reaching the same element. The result generalizes the earlier description of submonoids of Z^m, dropping the saturation condition and allowing arbitrary finitely generated abelian groups, including torsion.
Load-bearing premise
The whole reverse direction of Theorem 6.3 rests on the imported fact that L_P is a subgroup of Z^A and that the quotient monoid M=N^A/L_P is pointed and finitely generated; the paper cites this verification from earlier work rather than proving it, and if that fact fails in a torsion setting the characterization collapses.
Editorial extensions
If this is right
- The saturation condition used in the earlier characterization of submonoids of Z^m is superfluous; the same class of posets is described by the two finiteness conditions plus auto-equivalence, now over all finitely generated abelian groups.
- Auto-equivalent posets that are locally finite and have finitely many atoms are exactly the group-embeddable abelian monoid posets, so any such poset automatically has a translation-invariant structure and finite intervals.
- Full monoid posets are easy to recognize: by Theorem 2.8 they are precisely semigroup posets with a global minimum.
- Large families of posets are Cayley: all series-parallel posets are full semigroup posets, and weak orders, antichain blow-ups of join-semilattices, products, and series and parallel compositions of Cayley posets remain Cayley.
Reading between the lines
- If Theorem 6.3 holds, checking whether a finite poset comes from an affine semigroup reduces to checking auto-equivalence and counting atoms and intervals, so the recognition problem becomes order-theoretic rather than a search for generators.
- The construction of G=Z^A/L_P is essentially the universal abelian-group completion of the free monoid on atoms; it could be exported to other classes of uniform posets as a canonical group invariant even when no monoid representation is known.
- The paper's closing question—whether every transitive digraph is the Cayley graph of a monoid—links the poset problem to known examples of vertex-transitive digraphs that are not group Cayley graphs; a negative answer would yield uniform posets that are not monoid posets, as the paper sketches.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. This paper introduces Cayley posets, posets obtained from semigroup acts (X,S) when the action relation x≤y ⇔ ∃s∈S: xs=y is a partial order. The authors prove structural characterizations of several classes: all posets arise as monoid-act Cayley posets (Theorem 2.2); semigroup posets, monoid posets, full semigroup posets, and full monoid posets are characterized in terms of submonoids of the endomorphism monoid (Theorems 2.4, 2.6, 2.8, and Corollary 2.5). They then separate these classes with explicit examples, give closure and construction results (products, retracts, series/parallel compositions, blowups, weak orders), and end with a characterization of locally finite auto-equivalent posets with finitely many atoms as exactly the Cayley posets of finitely generated pointed submonoids of abelian groups (Theorem 6.3), removing the saturation condition of an earlier theorem of [4] and extending it from integer lattices to finitely generated abelian groups.
Significance. If the main theorem is correct, it is a valuable and clean generalization of the earlier characterization in [4], and the Sabidussi-type theorems provide useful tools for recognizing whether a poset is a semigroup or monoid poset. The paper is largely self-contained and contains many concrete examples, separation results, and constructions, including the result that series-parallel posets are full. The counterexamples separating the various classes are a strength. However, the central characterization currently rests on a lemma whose proof is largely delegated to a citation under a regime that the paper explicitly claims to extend, and another lemma is false as stated. These issues are fixable but require real work, so the paper cannot be accepted in its present form.
major comments (3)
- [Section 6, Lemma 6.2] The proof of Lemma 6.2 delegates to [4, Section 5] the three load-bearing facts on which Theorem 6.3 depends: that L_P is a subgroup of Z^A, that M = N^A/L_P is a pointed submonoid of G = Z^A/L_P, and that ψ is an order isomorphism. Since Theorem 6.3 is presented as removing the saturation condition of [4, Theorem 5.5], a citation to that earlier theorem cannot be assumed to cover the present setting without verification. These facts are true and can be proved directly from auto-equivalence, so the gap is repairable, but as written the 'if' direction of the headline characterization is not proved.
- [Section 6, Lemma 6.1] Lemma 6.1 is false as stated. For the two-element idempotent commutative monoid M = {0,a} with a+a = a, the action is acyclic and P(M,M) is the two-element chain, but the map φ_a defined by φ_a(x) = a+x sends both 0 and a to a and is not an order isomorphism from P to ↑a = {a}; hence P(M,M) is not auto-equivalent in the sense of the paper. The lemma should be restricted to cancellative acyclic abelian monoids, which is what the group-embeddable case supplies. This also invalidates the invocation 'By Lemma 6.1 P is auto-equivalent' in the proof of Proposition 6.4, where the displayed monoid operation is not cancellative.
- [Section 4, Proposition 4.7] The definition of the operation for the monoid-poset part of the parallel composition contains an undefined variable: the second case reads 't ∈ N′, t′ ∈ N and xt′ ≠ x', but no element x has been introduced in that paragraph. The assertion that associativity 'follows easily' from σ being a monoid homomorphism requires a full case check that is not supplied, and the claim that the order relation is the right one also needs proof. The intended construction appears repairable, but as printed this proposition is not substantiated.
minor comments (4)
- [Section 2, Theorem 2.8] In the forward direction, the sentence 'ex = x, thus x > e' should read 'x ≥ e', since equality occurs for x = e.
- [Section 3, Theorem 3.4] In Case II, the phrase 'for all z ∈ N*_c − {3}' is confusing because 3 is not an element of N*_c, and the argument should explicitly justify that 2·2 ≥ 4 from 2 ≤ 2·2. In Case IV the induction is written with 'k ∈ {3,...,c−2}' although the ground set consists of even integers; k should range over the even elements.
- [Section 4, Theorem 4.5] The associativity proof is extremely hard to verify because of apparent typos in the case analysis; for example, Case 2.3 writes '(t·t′)·t′′ = (tx)t′ = tx' and seems to drop t′′. The case analysis should be rewritten cleanly.
- [Section 6, Proposition 6.4] The argument that the monoid is not cancellative is compressed: the existence of (0,k) and (0,ℓ) with a·(0,k) = a·(0,ℓ) should be spelled out rather than asserted in one line.
Circularity Check
Theorem 6.3's 'if' direction rests on Lemma 6.2, where the crucial subgroup, pointedness, and isomorphism facts are delegated to [4, Section 5] by an overlapping author; this is load-bearing self-citation rather than full circularity.
-
self citation load bearing
[Section 6, Lemma 6.2 (and its use in Theorem 6.3)]
"It is not difficult to check that f is well defined (because P is auto-equivalent) and surjective (because P is locally finite) and the set LP :={α−β∈ ZA|f(α) = f(β)} is a subgroup of ZA (see [4, Section 5]). ... Furthermore, M is pointed and (P,≤) andP (M,M ) are isomorphic."
Lemma 6.2 is the entire 'if' direction of Theorem 6.3: from auto-equivalence plus local finiteness it must produce a pointed submonoid M of an abelian group with P≅P(M,M). The proof cites [4, Section 5] for the fact that LP is a subgroup, and then asserts without further derivation that M is pointed and that ψ is an order isomorphism. Reference [4] is by an overlapping author; the paper states that the earlier [4] characterization carried a saturation condition that Theorem 6.3 is designed to remove. Thus the new unsaturated/torsion part of the characterization rests on a self-citation whose coverage of the new regime is not demonstrated, with the remaining isomorphism and pointedness facts simply asserted.
full rationale
Most of the paper is self-contained and does not fit any data. The Sabidussi-type characterizations (Theorems 2.4, 2.6, 2.8), the separation examples, the constructions in Sections 4 and 5, and the local-finiteness counterexample 6.4 are proved directly from the definitions. The single load-bearing reliance on prior work by the same authors is in Lemma 6.2, whose subgroup LP, pointedness of M, and order isomorphism ψ are asserted with a citation to [4, Section 5] rather than proved in the unsaturated/torsion setting that Theorem 6.3 claims to cover. Because this lemma is exactly the 'if' direction of the headline characterization, the paper's central result depends on that self-citation; however, there is no fitted parameter being renamed as a prediction and no equation-level reduction to the hypotheses. The decomposition is mathematically true and can be derived from auto-equivalence, so the issue is a load-bearing proof gap through self-citation, not a circular derivation. Hence the moderate score of 4, with the central claim retaining independent content.
Assumptions & free parameters
assumptions (3)
- standard math Standard set-theoretic and algebraic background: ZFC, semigroups, monoids, acts, posets, Green's relations, and endomorphism monoids.
- domain assumption The relation defined by a semigroup act is taken as an order exactly when the act is s-unital and acyclic (Proposition 2.1).
- domain assumption Lemma 6.2 imports the LP subgroup construction and the property that M = N^A/LP is a pointed submonoid of an abelian group from an earlier paper, without reproving it.
invented entities (1)
-
Cayley poset
Cite this review
Pith. "Pith review of Cayley posets." pith.science (2026). https://pith.science/paper/2BAWR7RI
@misc{pith2026190809308,
author = {Pith},
title = {Pith review of: Cayley posets},
year = {2026},
howpublished = {\url{https://pith.science/paper/2BAWR7RI}},
note = {Machine review of arXiv:1908.09308}
}
abstract
We introduce Cayley posets as posets arising naturally from pairs $S<T$ of semigroups, much in the same way that Cayley graph arises from a (semi)group and a subset. We show that Cayley posets are a common generalization of several known classes of posets, e.g. posets of numerical semigroups (with torsion) and more generally affine semigroups. Furthermore, we give Sabidussi-type characterizations for Cayley posets and for several subclasses in terms of their endomorphism monoid. We show that large classes of posets are Cayley posets, e.g., series-parallel posets and (generalizations of) join-semilattices, but also provide examples of posets which cannot be represented this way. Finally, we characterize (locally finite, with a finite number of atoms) auto-equivalent posets - a class that generalizes a recently introduced notion for numerical semigroups - as those posets coming from a finitely generated submonoid of an abelian group.
Figures
Reference graph
Works this paper leans on
-
[4]
J. C HAPPELON , I. G ARCÍA -MARCO , L. P. M ONTEJANO , AND J. L. R AMÍREZ ALFONSÍN , Möbius function of semigroup posets through Hilbert series., J. Comb. Theory, Ser. A, 136 (2015), pp. 238–251
work page 2015
-
[1]
J. A RAÚJO , W. BENTZ , AND J. K ONIECZNY , Directed graphs of inner translations of semigroups., Semigroup Forum, 94 (2017), pp. 650–673
work page 2017
-
[2]
A. A SSI AND P. A. G ARCÍA -SÁNCHEZ , Numerical semigroups and applications., Cham: Springer, 2016
work page 2016
-
[3]
E. B RIALES , A. C AMPILLO , C. M ARIJUÁN , AND P. P ISÓN , Minimal systems of generators for ideals of semigroups, J. Pure Appl. Algebra, 124 (1998), pp. 7–30
work page 1998
-
[5]
A. H. C LIFFORD AND G. B. P RESTON , The algebraic theory of semigroups. Vol. I., vol. 7, American Mathe- matical Society (AMS), Providence, RI, 1961
work page 1961
-
[6]
D. A. C OX, J. B. L ITTLE , AND H. K. S CHENCK , Toric varieties, vol. 124 of Graduate Studies in Mathematics, American Mathematical Society, Providence, RI, 2011
2011
-
[7]
E. C ZABARKA , A. D UTLE , T. JOHNSTON , AND L. A. S ZÉKELY , Abelian groups yield many large families for the diamond problem., Eur. J. Math., 1 (2015), pp. 320–328
work page 2015
-
[8]
D. E ISENBUD AND B. S TURMFELS , Binomial ideals., Duke Math. J., 84 (1996), pp. 1–45
work page 1996
Show all 52 references
-
[9]
G ARCÍA -M ARCO AND K
I. G ARCÍA -M ARCO AND K. K NAUER , Chomp on numerical semigroups., Algebr. Comb., 1 (2018), pp. 371– 394
2018
-
[10]
G ODSIL AND G
C. G ODSIL AND G. R OYLE , Algebraic graph theory., vol. 207, New York, NY: Springer, 2001
2001
-
[11]
Y. H AO, X. G AO, AND Y. LUO, On Cayley graphs of symmetric inverse semigroups., Ars Comb., 100 (2011), pp. 307–319
2011
-
[12]
Y. H AO, X. G AO, AND Y. LUO, On the Cayley graphs of Brandt semigroups. , Commun. Algebra, 39 (2011), pp. 2874–2883
2011
-
[13]
H AO AND Y
Y. H AO AND Y. L UO, On the Cayley graphs of left (right) groups. , Southeast Asian Bull. Math., 34 (2010), pp. 685–691
2010
-
[14]
J. M. H OWIE , An introduction to semigroup theory. L. M. S. Monographs. V ol. 7. London - New York - San Francisco: Academic Press: a subsidiary of Harcourt Brace Jovanovich, Publishers. X, 272 p. £9.80 (1976)., 1976
1976
-
[15]
J IAN AND S
G. J IAN AND S. F AN, On undirected Cayley graphs of some completely simple semigroups. , Southeast Asian Bull. Math., 33 (2009), pp. 741–749
2009
-
[16]
K ATSABEKIS , M
A. K ATSABEKIS , M. M ORALES , AND A. T HOMA , Binomial generation of the radical of a lattice ideal. , J. Algebra, 324 (2010), pp. 1334–1346
2010
-
[17]
A. V. K ELAREV , On undirected Cayley graphs, Australas. J. Combin., 25 (2002), pp. 73–78
2002
-
[18]
A. V. K ELAREV , On Cayley graphs of inverse semigroups, Semigroup Forum, 72 (2006), pp. 411–418
2006
-
[19]
A. V. K ELAREV AND C. E. P RAEGER , On transitive Cayley graphs of groups and semigroups , European J. Combin., 24 (2003), pp. 59–72
2003
-
[20]
K HOSRAVI , On Cayley graphs of left groups., Houston J
B. K HOSRAVI , On Cayley graphs of left groups., Houston J. Math., 35 (2009), pp. 745–755
2009
-
[21]
K HOSRAVI , Some properties of Cayley graphs of cancellative semigroups., Proc
B. K HOSRAVI , Some properties of Cayley graphs of cancellative semigroups., Proc. Rom. Acad., Ser. A, Math. Phys. Tech. Sci. Inf. Sci., 17 (2016), pp. 3–10
2016
-
[22]
K HOSRAVI , On the Cayley graphs of completely simple semigroups
B. K HOSRAVI , On the Cayley graphs of completely simple semigroups. , Bull. Malays. Math. Sci. Soc. (2), 41 (2018), pp. 741–749
2018
-
[23]
K HOSRAVI AND B
B. K HOSRAVI AND B. K HOSRAVI , A characterization of Cayley graphs of Brandt semigroups., Bull. Malays. Math. Sci. Soc. (2), 35 (2012), pp. 399–410
2012
-
[24]
K HOSRAVI AND B
B. K HOSRAVI AND B. K HOSRAVI , On Cayley graphs of semilattices of semigroups. , Semigroup Forum, 86 (2013), pp. 114–132
2013
-
[25]
K HOSRAVI AND M
B. K HOSRAVI AND M. M AHMOUDI , On Cayley graphs of rectangular groups. , Discrete Math., 310 (2010), pp. 804–811. CAYLEY POSETS 19
2010
-
[26]
K ILP , U
M. K ILP , U. K NAUER , AND A. V. M IKHALEV , Monoids, acts and categories. With applications to wreath products and graphs. A handbook for students and researchers., Berlin: Walter de Gruyter, 2000
2000
-
[27]
K NAUER AND U
K. K NAUER AND U. K NAUER , Toroidal embeddings of right groups, Thai J. Math., 8 (2010), pp. 483–490
2010
-
[28]
K NAUER AND U
K. K NAUER AND U. K NAUER , On planar right groups., Semigroup Forum, 92 (2016), pp. 142–157
2016
-
[29]
K NAUER AND K
U. K NAUER AND K. K NAUER , Algebraic graph theory. Morphisms, monoids and matrices (to appear). 2nd revised and extended edition., Berlin: De Gruyter, 2nd revised and extended edition ed., 2019
2019
-
[30]
H. H. L ÓPEZ AND R. H. V ILLARREAL , Computing the degree of a lattice ideal of dimension one. , J. Symb. Comput., 65 (2014), pp. 15–28
2014
-
[31]
Y. L UO, Y. H AO, AND G. T. C LARKE , On the Cayley graphs of completely simple semigroups. , Semigroup Forum, 82 (2011), pp. 288–295
2011
-
[32]
M ARUŠI ˇC, Vertex transitive graphs and digraphs of order pk
D. M ARUŠI ˇC, Vertex transitive graphs and digraphs of order pk. Cycles in graphs, Workshop Simon Fraser Univ., Burnaby/Can. 1982, Ann. Discrete Math. 27, 115-128 (1985)., 1985
1985
-
[33]
B. D. M CKAY AND C. E. P RAEGER , Vertex-transitive graphs which are not Cayley graphs. I., J. Aust. Math. Soc., Ser. A, 56 (1994), pp. 53–63
1994
-
[34]
M EKSAWANG AND S
J. M EKSAWANG AND S. P ANMA , Cayley digraphs of Brandt semigroups relative to Green’s equivalence classes., Southeast Asian Bull. Math., 39 (2015), pp. 815–827
2015
-
[35]
M EKSAWANG , S
J. M EKSAWANG , S. PANMA , AND U. K NAUER , Characterization of finite simple semigroup digraphs., Algebra Discrete Math., 12 (2011), pp. 53–68
2011
-
[36]
M ILLER AND B
E. M ILLER AND B. S TURMFELS , Combinatorial commutative algebra. , vol. 227, New York, NY: Springer, 2005
2005
-
[37]
M ORALES AND A
M. M ORALES AND A. T HOMA , Complete intersection lattice ideals., J. Algebra, 284 (2005), pp. 755–770
2005
-
[38]
W. D. M UNN, Uniform semilattices and bisimple inverse semigroups. , Q. J. Math., Oxf. II. Ser., 17 (1966), pp. 151–159
1966
-
[39]
P ANMA , U
S. P ANMA , U. K NAUER , AND S. A RWORN , On transitive Cayley graphs of strong semilattices of right (left) groups., Discrete Math., 309 (2009), pp. 5393–5403
2009
-
[40]
J. L. R AMÍREZ ALFONSÍN , The Diophantine Frobenius problem., vol. 30, Oxford: Oxford University Press, 2005
2005
-
[41]
J. C. R OSALES AND P. A. G ARCÍA -SÁNCHEZ , Finitely generated commutative monoids, Nova Science Pub- lishers, Inc., Commack, NY , 1999
1999
-
[42]
J. C. R OSALES AND P. A. G ARCÍA -SÁNCHEZ , Numerical semigroups., vol. 20, Dordrecht: Springer, 2009
2009
-
[43]
S ABIDUSSI , On a class of fixed-point-free graphs., Proc
G. S ABIDUSSI , On a class of fixed-point-free graphs., Proc. Am. Math. Soc., 9 (1958), pp. 800–804
1958
-
[44]
D. V. S OLOMATIN , Direct products of cyclic semigroups admitting a planar Cayley graph. , Sibirskie Ehlek- tronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 3 (2006), pp. 238–252
2006
-
[45]
D. V. S OLOMATIN , Semigroups with outerplanar Cayley graphs , Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 8 (2011), pp. 191–212
2011
-
[46]
S UKSUMRAN AND S
T. S UKSUMRAN AND S. P ANMA , On connected Cayley graphs of semigroups. , Thai J. Math., 13 (2015), pp. 641–652
2015
-
[47]
V ALDES , R
J. V ALDES , R. E. TARJAN , AND E. L. L AWLER , The recognition of series parallel digraphs., SIAM J. Comput., 11 (1982), pp. 298–313
1982
-
[48]
R. H. V ILLARREAL , Monomial algebras, Monographs and Research Notes in Mathematics, CRC Press, Boca Raton, FL, second ed., 2015
2015
-
[49]
W ANG AND Y
S. W ANG AND Y. LI, On Cayley graphs of completely 0-simple semigroups. , Cent. Eur. J. Math., 11 (2013), pp. 924–930
2013
-
[50]
W ANG AND H
W. W ANG AND H. H OU, Cayley graphs of strong semilattices of left groups., J. Wuhan Univ., Nat. Sci. Ed., 55 (2009), pp. 633–636
2009
-
[51]
A. T. W HITE , Graphs of groups on surfaces , vol. 188 of North-Holland Mathematics Studies, North-Holland Publishing Co., Amsterdam, 2001. Interactions and models
2001
-
[52]
Z HANG , Clifford semigroups with genus zero , in Semigroups, Acts and Categories with Applications to Graphs, Proceedings, Tartu 2007, vol
X. Z HANG , Clifford semigroups with genus zero , in Semigroups, Acts and Categories with Applications to Graphs, Proceedings, Tartu 2007, vol. 3 of Mathematics Studies, Estonian Mathematical Society, Tartu, 2008, pp. 151–160
2007
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.