The Commuting Graph of the Symmetric Inverse Semigroup
Jo\~ao Ara\'ujo, Wolfram Bentz, Janusz Konieczny

TL;DR
This paper explores the structure of the commuting graph of the symmetric inverse semigroup, calculating its clique number and diameters for various cases, and provides new insights into commutative subsemigroups.
Contribution
It introduces the first detailed analysis of the commuting graph of the symmetric inverse semigroup, including clique number and diameter calculations for different set sizes.
Findings
Clique number of the commuting graph of i(X) determined.
Diameters of commuting graphs for proper ideals characterized.
When |X| is odd and divisible by at least two primes, diameter is 4 or 5.
Abstract
The commuting graph of a finite non-commutative semigroup , denoted , is a simple graph whose vertices are the non-central elements of and two distinct vertices are adjacent if . Let be the symmetric inverse semigroup of partial injective transformations on a finite set . The semigroup has the symmetric group of permutations on as its group of units. In 1989, Burns and Goldsmith determined the clique number of the commuting graph of . In 2008, Iranmanesh and Jafarzadeh found an upper bound of the diameter of , and in 2011, Dol\u{z}an and Oblak claimed (but their proof has a GAP) that this upper bound is in fact the exact value. The goal of this paper is to begin the study of the commuting graph of the symmetric inverse semigroup . We calculate the clique number of , the diameters…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Finite Group Theory Research · Rings, Modules, and Algebras
