<p>It is well known that not every finite group arises as the full automorphism group of some group. Here we show that the situation is dramatically different when considering the category of partial groups, <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\({\mathcal {P}art}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">P</mi> <mi>a</mi> <mi>r</mi> <mi>t</mi> </mrow> </math></EquationSource> </InlineEquation>, as defined by Chermak: given any group <i>H</i> there exists infinitely many non isomorphic partial groups <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\({\mathbb M}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">M</mi> </math></EquationSource> </InlineEquation> such that <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\operatorname {Aut}_{\mathcal {P}art}({\mathbb M})\cong H\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mo>Aut</mo> <mrow> <mi mathvariant="script">P</mi> <mi>a</mi> <mi>r</mi> <mi>t</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi mathvariant="double-struck">M</mi> <mo stretchy="false">)</mo> </mrow> <mo>≅</mo> <mi>H</mi> </mrow> </math></EquationSource> </InlineEquation>. To prove this result, given any simple undirected graph <i>G</i> we construct a partial group <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\({\mathbb P}(G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">P</mi> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, called the path partial group associated to <i>G</i>, such that <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\operatorname {Aut}_{\mathcal {P}art}\big ({\mathbb P}(G)\big )\cong \operatorname {Aut}_{\mathcal {G}raphs}(G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mo>Aut</mo> <mrow> <mi mathvariant="script">P</mi> <mi>a</mi> <mi>r</mi> <mi>t</mi> </mrow> </msub> <mrow> <mo maxsize="1.2em" minsize="1.2em" stretchy="true">(</mo> </mrow> <mi mathvariant="double-struck">P</mi> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> <mrow> <mo maxsize="1.2em" minsize="1.2em" stretchy="true">)</mo> </mrow> <mo>≅</mo> <msub> <mo>Aut</mo> <mrow> <mi mathvariant="script">G</mi> <mi>r</mi> <mi>a</mi> <mi>p</mi> <mi>h</mi> <mi>s</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>.</p>

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

Path partial groups

  • Antonio Díaz Ramos,
  • Rémi Molinier,
  • Antonio Viruel

摘要

It is well known that not every finite group arises as the full automorphism group of some group. Here we show that the situation is dramatically different when considering the category of partial groups, \({\mathcal {P}art}\) P a r t , as defined by Chermak: given any group H there exists infinitely many non isomorphic partial groups \({\mathbb M}\) M such that \(\operatorname {Aut}_{\mathcal {P}art}({\mathbb M})\cong H\) Aut P a r t ( M ) H . To prove this result, given any simple undirected graph G we construct a partial group \({\mathbb P}(G)\) P ( G ) , called the path partial group associated to G, such that \(\operatorname {Aut}_{\mathcal {P}art}\big ({\mathbb P}(G)\big )\cong \operatorname {Aut}_{\mathcal {G}raphs}(G)\) Aut P a r t ( P ( G ) ) Aut G r a p h s ( G ) .