<p>A semigroup <i>S</i> is called <i>rectangular</i> if every element acts as a middle identity, i.e., <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(ler = lr\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>l</mi> <mi>e</mi> <mi>r</mi> <mo>=</mo> <mi>l</mi> <mi>r</mi> </mrow> </math></EquationSource> </InlineEquation> holds for all <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(e, l, r \in S\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>e</mi> <mo>,</mo> <mi>l</mi> <mo>,</mo> <mi>r</mi> <mo>∈</mo> <mi>S</mi> </mrow> </math></EquationSource> </InlineEquation>. The class of rectangular semigroups naturally includes the subclasses of rectangular ideal extensions of left zero semigroups by null quotients, as well as rectangular ideal extensions of right zero semigroups by null quotients. It is shown that the number of pairwise nonisomorphic semigroups of order <i>n</i> arising as ideal extensions of a left (right) zero semigroup by a null quotient coincides with the number <i>p</i>(<i>n</i>) of partitions of <i>n</i>. We denote by <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\textrm{sie}(m,k)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mtext>sie</mtext> <mo stretchy="false">(</mo> <mi>m</mi> <mo>,</mo> <mi>k</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> the number of pairwise nonisomorphic <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\((m\!+\!k)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>m</mi> <mspace width="-0.166667em" /> <mo>+</mo> <mspace width="-0.166667em" /> <mi>k</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>-element rectangular ideal extensions of a left (right) zero semigroup of order <i>m</i> by a null quotient semigroup, and prove that <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\textrm{sie}(k,k)= 1+ \textrm{sie}(k-1,k) = p(k)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mtext>sie</mtext> <mo stretchy="false">(</mo> <mi>k</mi> <mo>,</mo> <mi>k</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mn>1</mn> <mo>+</mo> <mtext>sie</mtext> <mo stretchy="false">(</mo> <mi>k</mi> <mo>-</mo> <mn>1</mn> <mo>,</mo> <mi>k</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mi>p</mi> <mo stretchy="false">(</mo> <mi>k</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> for every integer <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(k&gt;1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>&gt;</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>. Moreover, we show that for each positive integer <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(k\)</EquationSource> <EquationSource Format="MATHML"><math> <mi>k</mi> </math></EquationSource> </InlineEquation> the sequence <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(\textrm{sie}(m,k)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mtext>sie</mtext> <mo stretchy="false">(</mo> <mi>m</mi> <mo>,</mo> <mi>k</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> stabilises once <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(m \ge k\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>≥</mo> <mi>k</mi> </mrow> </math></EquationSource> </InlineEquation>, that is, <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(\textrm{sie}(m,k)=\textrm{sie}(k,k)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mtext>sie</mtext> <mo stretchy="false">(</mo> <mi>m</mi> <mo>,</mo> <mi>k</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mtext>sie</mtext> <mo stretchy="false">(</mo> <mi>k</mi> <mo>,</mo> <mi>k</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> for all <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(m\ge k\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>≥</mo> <mi>k</mi> </mrow> </math></EquationSource> </InlineEquation>. Burnside-type formulas for <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(\textrm{sie}(m,k)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mtext>sie</mtext> <mo stretchy="false">(</mo> <mi>m</mi> <mo>,</mo> <mi>k</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> are derived and applied to compute these values for small parameters <i>m</i> and <i>k</i> using algorithms implemented in <Emphasis FontCategory="NonProportional">Python</Emphasis>. Finally, a lower bound <Equation ID="Equ3"> <EquationSource Format="TEX">\(\begin{aligned} \textrm{rs}(n) \ge 2p(n) + \tau (n) - 3 \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <mtext>rs</mtext> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> <mo>≥</mo> <mn>2</mn> <mi>p</mi> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> <mo>+</mo> <mi>τ</mi> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> <mo>-</mo> <mn>3</mn> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>for the number <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\(\textrm{rs}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mtext>rs</mtext> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> of all pairwise nonisomorphic rectangular semigroups of order <i>n</i> is established, where <InlineEquation ID="IEq14"> <EquationSource Format="TEX">\(\tau (n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>τ</mi> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> denotes the number of positive divisors of <i>n</i>, and it is shown that this bound is attained if and only if <InlineEquation ID="IEq15"> <EquationSource Format="TEX">\(n\in \{2,3,4\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>∈</mo> <mo stretchy="false">{</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> <mo>,</mo> <mn>4</mn> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>.</p>

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

On rectangular ideal extensions of left zero semigroups by null semigroups

  • Volodymyr M. Gavrylkiv

摘要

A semigroup S is called rectangular if every element acts as a middle identity, i.e., \(ler = lr\) l e r = l r holds for all \(e, l, r \in S\) e , l , r S . The class of rectangular semigroups naturally includes the subclasses of rectangular ideal extensions of left zero semigroups by null quotients, as well as rectangular ideal extensions of right zero semigroups by null quotients. It is shown that the number of pairwise nonisomorphic semigroups of order n arising as ideal extensions of a left (right) zero semigroup by a null quotient coincides with the number p(n) of partitions of n. We denote by \(\textrm{sie}(m,k)\) sie ( m , k ) the number of pairwise nonisomorphic \((m\!+\!k)\) ( m + k ) -element rectangular ideal extensions of a left (right) zero semigroup of order m by a null quotient semigroup, and prove that \(\textrm{sie}(k,k)= 1+ \textrm{sie}(k-1,k) = p(k)\) sie ( k , k ) = 1 + sie ( k - 1 , k ) = p ( k ) for every integer \(k>1\) k > 1 . Moreover, we show that for each positive integer \(k\) k the sequence \(\textrm{sie}(m,k)\) sie ( m , k ) stabilises once \(m \ge k\) m k , that is, \(\textrm{sie}(m,k)=\textrm{sie}(k,k)\) sie ( m , k ) = sie ( k , k ) for all \(m\ge k\) m k . Burnside-type formulas for \(\textrm{sie}(m,k)\) sie ( m , k ) are derived and applied to compute these values for small parameters m and k using algorithms implemented in Python. Finally, a lower bound \(\begin{aligned} \textrm{rs}(n) \ge 2p(n) + \tau (n) - 3 \end{aligned}\) rs ( n ) 2 p ( n ) + τ ( n ) - 3 for the number \(\textrm{rs}(n)\) rs ( n ) of all pairwise nonisomorphic rectangular semigroups of order n is established, where \(\tau (n)\) τ ( n ) denotes the number of positive divisors of n, and it is shown that this bound is attained if and only if \(n\in \{2,3,4\}\) n { 2 , 3 , 4 } .