<p>Given a semigroup <i>S</i> and <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10532_Article_IEq1.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="58" /> </InlineMediaObject> <EquationSource Format="TEX">\(s,t \in S\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>s</mi> <mo>,</mo> <mi>t</mi> <mo>∈</mo> <mi>S</mi> </mrow> </math></EquationSource> </InlineEquation>, write <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10532_Article_IEq2.gif" Format="GIF" Height="22" Rendition="HTML" Resolution="72" Type="Linedraw" Width="48" /> </InlineMediaObject> <EquationSource Format="TEX">\(s \sim _p^1 t\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>s</mi> <msubsup> <mo>∼</mo> <mi>p</mi> <mn>1</mn> </msubsup> <mi>t</mi> </mrow> </math></EquationSource> </InlineEquation> if <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10532_Article_IEq3.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="50" /> </InlineMediaObject> <EquationSource Format="TEX">\(s=pr\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>s</mi> <mo>=</mo> <mi>p</mi> <mi>r</mi> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10532_Article_IEq4.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="48" /> </InlineMediaObject> <EquationSource Format="TEX">\(t=rp\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>t</mi> <mo>=</mo> <mi>r</mi> <mi>p</mi> </mrow> </math></EquationSource> </InlineEquation>, for some <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10532_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="107" /> </InlineMediaObject> <EquationSource Format="TEX">\(p,r \in S \cup \{1\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>,</mo> <mi>r</mi> <mo>∈</mo> <mi>S</mi> <mo>∪</mo> <mo stretchy="false">{</mo> <mn>1</mn> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>. This relation, known as “primary conjugacy”, along with its transitive closure <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10532_Article_IEq6.gif" Format="GIF" Height="13" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\(\sim _p\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mo>∼</mo> <mi>p</mi> </msub> </math></EquationSource> </InlineEquation>, has been extensively used and studied in many fields of algebra. This paper is devoted to a natural generalization, defined by <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10532_Article_IEq7.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="48" /> </InlineMediaObject> <EquationSource Format="TEX">\(s \sim _s^1 t\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>s</mi> <msubsup> <mo>∼</mo> <mi>s</mi> <mn>1</mn> </msubsup> <mi>t</mi> </mrow> </math></EquationSource> </InlineEquation> whenever <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10532_Article_IEq8.gif" Format="GIF" Height="13" Rendition="HTML" Resolution="72" Type="Linedraw" Width="89" /> </InlineMediaObject> <EquationSource Format="TEX">\(s=p_1\cdots p_{n}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>s</mi> <mo>=</mo> <msub> <mi>p</mi> <mn>1</mn> </msub> <mo>⋯</mo> <msub> <mi>p</mi> <mi>n</mi> </msub> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10532_Article_IEq9.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="118" /> </InlineMediaObject> <EquationSource Format="TEX">\(t=p_{f(1)}\cdots p_{f(n)}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>t</mi> <mo>=</mo> <msub> <mi>p</mi> <mrow> <mi>f</mi> <mo stretchy="false">(</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </msub> <mo>⋯</mo> <msub> <mi>p</mi> <mrow> <mi>f</mi> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </msub> </mrow> </math></EquationSource> </InlineEquation>, for some <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10532_Article_IEq10.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="151" /> </InlineMediaObject> <EquationSource Format="TEX">\(p_1, \dots , p_n \in S \cup \{1\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>p</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <msub> <mi>p</mi> <mi>n</mi> </msub> <mo>∈</mo> <mi>S</mi> <mo>∪</mo> <mrow> <mo stretchy="false">{</mo> <mn>1</mn> <mo stretchy="false">}</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and permutation <i>f</i> of <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10532_Article_IEq11.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="79" /> </InlineMediaObject> <EquationSource Format="TEX">\(\{1, \dots , n\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">{</mo> <mn>1</mn> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <mi>n</mi> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>, together with its transitive closure <InlineEquation ID="IEq12"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10532_Article_IEq12.gif" Format="GIF" Height="11" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\(\sim _s\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mo>∼</mo> <mi>s</mi> </msub> </math></EquationSource> </InlineEquation>. The relation <InlineEquation ID="IEq13"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10532_Article_IEq12.gif" Format="GIF" Height="11" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\(\sim _s\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mo>∼</mo> <mi>s</mi> </msub> </math></EquationSource> </InlineEquation> is the congruence generated by either <InlineEquation ID="IEq14"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10532_Article_IEq14.gif" Format="GIF" Height="22" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\(\sim _p^1\)</EquationSource> <EquationSource Format="MATHML"><math> <msubsup> <mo>∼</mo> <mi>p</mi> <mn>1</mn> </msubsup> </math></EquationSource> </InlineEquation> or <InlineEquation ID="IEq15"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10532_Article_IEq6.gif" Format="GIF" Height="13" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\(\sim _p\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mo>∼</mo> <mi>p</mi> </msub> </math></EquationSource> </InlineEquation>, and is moreover the least commutative congruence on any semigroup. We explore general properties of <InlineEquation ID="IEq16"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10532_Article_IEq12.gif" Format="GIF" Height="11" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\(\sim _s\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mo>∼</mo> <mi>s</mi> </msub> </math></EquationSource> </InlineEquation>, discuss it in the context of groups and rings, compare it to other semigroup conjugacy relations, and fully describe its equivalence classes in free, Rees matrix, graph inverse, and various transformation semigroups.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Conjugacy and Least Commutative Congruences in Semigroups

  • Zachary Mesyan

摘要

Given a semigroup S and \(s,t \in S\) s , t S , write \(s \sim _p^1 t\) s p 1 t if \(s=pr\) s = p r and \(t=rp\) t = r p , for some \(p,r \in S \cup \{1\}\) p , r S { 1 } . This relation, known as “primary conjugacy”, along with its transitive closure \(\sim _p\) p , has been extensively used and studied in many fields of algebra. This paper is devoted to a natural generalization, defined by \(s \sim _s^1 t\) s s 1 t whenever \(s=p_1\cdots p_{n}\) s = p 1 p n and \(t=p_{f(1)}\cdots p_{f(n)}\) t = p f ( 1 ) p f ( n ) , for some \(p_1, \dots , p_n \in S \cup \{1\}\) p 1 , , p n S { 1 } and permutation f of \(\{1, \dots , n\}\) { 1 , , n } , together with its transitive closure \(\sim _s\) s . The relation \(\sim _s\) s is the congruence generated by either \(\sim _p^1\) p 1 or \(\sim _p\) p , and is moreover the least commutative congruence on any semigroup. We explore general properties of \(\sim _s\) s , discuss it in the context of groups and rings, compare it to other semigroup conjugacy relations, and fully describe its equivalence classes in free, Rees matrix, graph inverse, and various transformation semigroups.