Pseudo -transitivity for finite semigroups of order at most eight
Pseudo -transitivity for finite semigroups of order at most eight
Let be a semigroup, and let be its relation as above. The semigroup is pseudo -transitive if, whenever satisfy , , and is -essential, there exist elements such that
and the conditions defining pseudo -transitivity hold. Here denotes the smallest partially ordered set containing .
Pseudo -transitivity conjecture. If
then is pseudo -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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.