Pseudo \ll-transitivity for finite semigroups of order at most eight

Let SS be a semigroup, and let \ll be its relation as above. The semigroup SS is pseudo \ll-transitive if, whenever u,s,tSu,s,t\in S satisfy ustu\lll st, u≪̸stu\not\ll st, and (u,st)(u,st) is nn-essential, there exist elements v1,,vnv_1,\ldots,v_n such that

uv1vnstu\ll v_1\ll\cdots\ll v_n\ll st

and the conditions defining pseudo \ll-transitivity hold. Here \lll denotes the smallest partially ordered set containing \ll.

Pseudo \ll-transitivity conjecture. If

S8,|S|\leq 8,

then SS is pseudo \ll-transitive.

This conjecture was verified by a C# program for semigroups of order at most eight; no general proof or resolution beyond that computational verification is supplied here.

Sources & referencesView supporting material

Primary source

M. H. Shahzamanian, “The determinant of \(\)-smooth semigroups”, arXiv:2506.13700 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.