<p>A 2-cell embedding of a hypergraph on a closed surface is called regular if its automorphism group acts regularly on its flags. This paper gives an enumeration of regular hypermaps with the automorphism group <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2906_Article_IEq3.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="103" /> </InlineMediaObject> <EquationSource Format="TEX">\({\overline{G}}=\hbox {PSL}(3,p)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mover> <mi>G</mi> <mo>¯</mo> </mover> <mo>=</mo> <mtext>PSL</mtext> <mrow> <mo stretchy="false">(</mo> <mn>3</mn> <mo>,</mo> <mi>p</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> for a prime <i>p</i> and hyperface-valency at least 6. In this paper, every hypermap will be represented by <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2906_Article_IEq4.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="122" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal {H}=\mathcal {H}({\overline{G}}; {\overline{t}} , {\overline{r}}, \overline{\ell })\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">H</mi> <mo>=</mo> <mi mathvariant="script">H</mi> <mo stretchy="false">(</mo> <mover> <mi>G</mi> <mo>¯</mo> </mover> <mo>;</mo> <mover> <mi>t</mi> <mo>¯</mo> </mover> <mo>,</mo> <mover> <mi>r</mi> <mo>¯</mo> </mover> <mo>,</mo> <mover> <mi>ℓ</mi> <mo>¯</mo> </mover> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> for some involutions <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2906_Article_IEq5.gif" Format="GIF" Height="18" Rendition="HTML" Resolution="72" Type="Linedraw" Width="25" /> </InlineMediaObject> <EquationSource Format="TEX">\({\overline{t}} , {\overline{r}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mover> <mi>t</mi> <mo>¯</mo> </mover> <mo>,</mo> <mover> <mi>r</mi> <mo>¯</mo> </mover> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2906_Article_IEq6.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="12" /> </InlineMediaObject> <EquationSource Format="TEX">\(\overline{\ell }\)</EquationSource> <EquationSource Format="MATHML"><math> <mover> <mi>ℓ</mi> <mo>¯</mo> </mover> </math></EquationSource> </InlineEquation>. Up to the hypermap isomorphism, we list <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2906_Article_IEq7.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="10" /> </InlineMediaObject> <EquationSource Format="TEX">\({\overline{t}} \)</EquationSource> <EquationSource Format="MATHML"><math> <mover> <mi>t</mi> <mo>¯</mo> </mover> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2906_Article_IEq8.gif" Format="GIF" Height="13" Rendition="HTML" Resolution="72" Type="Linedraw" Width="11" /> </InlineMediaObject> <EquationSource Format="TEX">\({\overline{r}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mover> <mi>r</mi> <mo>¯</mo> </mover> </math></EquationSource> </InlineEquation> and the number <i>n</i>(<i>t</i>,&#xa0;<i>r</i>) of hypermaps (that is the number of <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2906_Article_IEq9.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="12" /> </InlineMediaObject> <EquationSource Format="TEX">\(\overline{\ell }\)</EquationSource> <EquationSource Format="MATHML"><math> <mover> <mi>ℓ</mi> <mo>¯</mo> </mover> </math></EquationSource> </InlineEquation>) for given <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2906_Article_IEq10.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="10" /> </InlineMediaObject> <EquationSource Format="TEX">\({\overline{t}} \)</EquationSource> <EquationSource Format="MATHML"><math> <mover> <mi>t</mi> <mo>¯</mo> </mover> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2906_Article_IEq11.gif" Format="GIF" Height="13" Rendition="HTML" Resolution="72" Type="Linedraw" Width="11" /> </InlineMediaObject> <EquationSource Format="TEX">\({\overline{r}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mover> <mi>r</mi> <mo>¯</mo> </mover> </math></EquationSource> </InlineEquation>. In principle, <InlineEquation ID="IEq12"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2906_Article_IEq12.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="12" /> </InlineMediaObject> <EquationSource Format="TEX">\(\overline{\ell }\)</EquationSource> <EquationSource Format="MATHML"><math> <mover> <mi>ℓ</mi> <mo>¯</mo> </mover> </math></EquationSource> </InlineEquation> can be explicitly written but we shall not do that, as it is very cumbersome.</p>

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

Regular Hypermaps with the Automorphism Group \(\hbox {PSL}(3,p)\)

  • Xinyuan Hu,
  • Shao-Fei Du

摘要

A 2-cell embedding of a hypergraph on a closed surface is called regular if its automorphism group acts regularly on its flags. This paper gives an enumeration of regular hypermaps with the automorphism group \({\overline{G}}=\hbox {PSL}(3,p)\) G ¯ = PSL ( 3 , p ) for a prime p and hyperface-valency at least 6. In this paper, every hypermap will be represented by \(\mathcal {H}=\mathcal {H}({\overline{G}}; {\overline{t}} , {\overline{r}}, \overline{\ell })\) H = H ( G ¯ ; t ¯ , r ¯ , ¯ ) for some involutions \({\overline{t}} , {\overline{r}}\) t ¯ , r ¯ and \(\overline{\ell }\) ¯ . Up to the hypermap isomorphism, we list \({\overline{t}} \) t ¯ , \({\overline{r}}\) r ¯ and the number n(tr) of hypermaps (that is the number of \(\overline{\ell }\) ¯ ) for given \({\overline{t}} \) t ¯ and \({\overline{r}}\) r ¯ . In principle, \(\overline{\ell }\) ¯ can be explicitly written but we shall not do that, as it is very cumbersome.