<p>Let <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10503_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="92" /> </InlineMediaObject> <EquationSource Format="TEX">\(N_{ARF}(m,\mathscr {C})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>N</mi> <mrow> <mi mathvariant="italic">ARF</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>m</mi> <mo>,</mo> <mi mathvariant="script">C</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> denote the number of Arf numerical semigroups with multiplicity <i>m</i> and conductor <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10503_Article_IEq2.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathscr {C}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">C</mi> </math></EquationSource> </InlineEquation>. In an earlier paper of the first author (Semigroup Forum 105:478–487, 2022), it was proved that <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10503_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="92" /> </InlineMediaObject> <EquationSource Format="TEX">\(N_{ARF}(m,\mathscr {C})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>N</mi> <mrow> <mi mathvariant="italic">ARF</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>m</mi> <mo>,</mo> <mi mathvariant="script">C</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> depends only on the congruence class of <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10503_Article_IEq4.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathscr {C}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">C</mi> </math></EquationSource> </InlineEquation> modulo <i>m</i> if <i>m</i> is prime. In the same paper, it was noticed that there are composite numbers <i>m</i> for which <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10503_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="92" /> </InlineMediaObject> <EquationSource Format="TEX">\(N_{ARF}(m,\mathscr {C})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>N</mi> <mrow> <mi mathvariant="italic">ARF</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>m</mi> <mo>,</mo> <mi mathvariant="script">C</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> depends only on the congruence class of <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10503_Article_IEq6.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathscr {C}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">C</mi> </math></EquationSource> </InlineEquation> modulo <i>m</i> for some congruence classes, and the author had posed the question of characterizing such <i>m</i> and congruence classes of <i>m</i> for which <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10503_Article_IEq7.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="92" /> </InlineMediaObject> <EquationSource Format="TEX">\(N_{ARF}(m,\mathscr {C})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>N</mi> <mrow> <mi mathvariant="italic">ARF</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>m</mi> <mo>,</mo> <mi mathvariant="script">C</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is an invariant of those classes. We prove that <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10503_Article_IEq8.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="92" /> </InlineMediaObject> <EquationSource Format="TEX">\(N_{ARF}(m,\mathscr {C})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>N</mi> <mrow> <mi mathvariant="italic">ARF</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>m</mi> <mo>,</mo> <mi mathvariant="script">C</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is an invariant of the congruence class of <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10503_Article_IEq9.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathscr {C}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">C</mi> </math></EquationSource> </InlineEquation> (mod <i>m</i>) if and only if <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10503_Article_IEq10.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="55" /> </InlineMediaObject> <EquationSource Format="TEX">\(m = p^n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>=</mo> <msup> <mi>p</mi> <mi>n</mi> </msup> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10503_Article_IEq11.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="186" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathscr {C} \equiv (tp^{n-1}+1) \ (\textrm{mod}\ p^n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">C</mi> <mo>≡</mo> <mrow> <mo stretchy="false">(</mo> <mi>t</mi> <msup> <mi>p</mi> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mspace width="4pt" /> <mrow> <mo stretchy="false">(</mo> <mtext>mod</mtext> <mspace width="4pt" /> <msup> <mi>p</mi> <mi>n</mi> </msup> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> where <InlineEquation ID="IEq12"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10503_Article_IEq12.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="45" /> </InlineMediaObject> <EquationSource Format="TEX">\(n\in {\mathbb {N}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>∈</mo> <mi mathvariant="double-struck">N</mi> </mrow> </math></EquationSource> </InlineEquation>, <i>p</i> is prime, <InlineEquation ID="IEq13"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="233_2025_10503_Article_IEq13.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="132" /> </InlineMediaObject> <EquationSource Format="TEX">\(t \in \{1, \ldots , p-1\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>t</mi> <mo>∈</mo> <mo stretchy="false">{</mo> <mn>1</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mi>p</mi> <mo>-</mo> <mn>1</mn> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>.</p>

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

On the Enumeration of Arf Numerical Semigroups with Given Multiplicity and Conductor

  • Halil İbrahim Karakaş,
  • Nesrin Tutaş

摘要

Let \(N_{ARF}(m,\mathscr {C})\) N ARF ( m , C ) denote the number of Arf numerical semigroups with multiplicity m and conductor \(\mathscr {C}\) C . In an earlier paper of the first author (Semigroup Forum 105:478–487, 2022), it was proved that \(N_{ARF}(m,\mathscr {C})\) N ARF ( m , C ) depends only on the congruence class of \(\mathscr {C}\) C modulo m if m is prime. In the same paper, it was noticed that there are composite numbers m for which \(N_{ARF}(m,\mathscr {C})\) N ARF ( m , C ) depends only on the congruence class of \(\mathscr {C}\) C modulo m for some congruence classes, and the author had posed the question of characterizing such m and congruence classes of m for which \(N_{ARF}(m,\mathscr {C})\) N ARF ( m , C ) is an invariant of those classes. We prove that \(N_{ARF}(m,\mathscr {C})\) N ARF ( m , C ) is an invariant of the congruence class of \(\mathscr {C}\) C (mod m) if and only if \(m = p^n\) m = p n and \(\mathscr {C} \equiv (tp^{n-1}+1) \ (\textrm{mod}\ p^n)\) C ( t p n - 1 + 1 ) ( mod p n ) where \(n\in {\mathbb {N}}\) n N , p is prime, \(t \in \{1, \ldots , p-1\}\) t { 1 , , p - 1 } .