<p>Let <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1425_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="93" /> </InlineMediaObject> <EquationSource Format="TEX">\(G\leqslant \textrm{Sym}(\Omega )\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mo>⩽</mo> <mtext>Sym</mtext> <mo stretchy="false">(</mo> <mi mathvariant="normal">Ω</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> be a finite transitive permutation group with point stabiliser <i>H</i>. We say that a subgroup <i>K</i> of <i>G</i> is a fixer if every element of <i>K</i> has fixed points, and we say that <i>K</i> is large if <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1425_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="79" /> </InlineMediaObject> <EquationSource Format="TEX">\(|K| \geqslant |H|\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">|</mo> <mi>K</mi> <mo stretchy="false">|</mo> <mo>⩾</mo> <mo stretchy="false">|</mo> <mi>H</mi> <mo stretchy="false">|</mo> </mrow> </math></EquationSource> </InlineEquation>. There is a special interest in studying large fixers due to connections with Erdős-Ko-Rado type problems. In this paper, we classify up to conjugacy the large fixers of the almost simple primitive groups with socle <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1425_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="58" /> </InlineMediaObject> <EquationSource Format="TEX">\(\textrm{PSL}_2(q)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mtext>PSL</mtext> <mn>2</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mi>q</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, and we use this result to verify a special case of a conjecture of Spiga on permutation characters. We also present some results on large fixers of almost simple primitive groups with socle an alternating or sporadic group.</p>

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

Fixers and derangements of finite permutation groups

  • Hong Yi Huang,
  • Cai Heng Li,
  • Yi Lin Xie

摘要

Let \(G\leqslant \textrm{Sym}(\Omega )\) G Sym ( Ω ) be a finite transitive permutation group with point stabiliser H. We say that a subgroup K of G is a fixer if every element of K has fixed points, and we say that K is large if \(|K| \geqslant |H|\) | K | | H | . There is a special interest in studying large fixers due to connections with Erdős-Ko-Rado type problems. In this paper, we classify up to conjugacy the large fixers of the almost simple primitive groups with socle \(\textrm{PSL}_2(q)\) PSL 2 ( q ) , and we use this result to verify a special case of a conjecture of Spiga on permutation characters. We also present some results on large fixers of almost simple primitive groups with socle an alternating or sporadic group.