<p>We study finite groups <i>G</i> having a subgroup <i>H</i> and <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2917_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="78" /> </InlineMediaObject> <EquationSource Format="TEX">\(D \subset G {{\setminus }} H\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>D</mi> <mo>⊂</mo> <mi>G</mi> <mo lspace="0.15em" rspace="0.15em" stretchy="false">\</mo> <mi>H</mi> </mrow> </math></EquationSource> </InlineEquation> such that (i) the multiset <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2917_Article_IEq2.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="133" /> </InlineMediaObject> <EquationSource Format="TEX">\(\{ xy^{-1}:x,y \in D\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">{</mo> <mi>x</mi> <msup> <mi>y</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>:</mo> <mi>x</mi> <mo>,</mo> <mi>y</mi> <mo>∈</mo> <mi>D</mi> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation> has every element that is not in <i>H</i> occur the same number of times (such a <i>D</i> is called a <i>relative difference set</i>); (ii) <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2917_Article_IEq3.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="259" /> </InlineMediaObject> <EquationSource Format="TEX">\(G=D\cup D^{(-1)} \cup H \text{(disjoint } \text{ union) }\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mo>=</mo> <mi>D</mi> <mo>∪</mo> <msup> <mi>D</mi> <mrow> <mo stretchy="false">(</mo> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </msup> <mo>∪</mo> <mi>H</mi> <mtext>(disjoint</mtext> <mspace width="0.333333em" /> <mspace width="0.333333em" /> <mtext>union)</mtext> <mspace width="0.333333em" /> </mrow> </math></EquationSource> </InlineEquation>; (iii) <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2917_Article_IEq4.gif" Format="GIF" Height="18" Rendition="HTML" Resolution="72" Type="Linedraw" Width="108" /> </InlineMediaObject> <EquationSource Format="TEX">\(D \cap D^{(-1)} =\emptyset \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>D</mi> <mo>∩</mo> <msup> <mi>D</mi> <mrow> <mo stretchy="false">(</mo> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </msup> <mo>=</mo> <mi mathvariant="normal">∅</mi> </mrow> </math></EquationSource> </InlineEquation>. We show that adding an additional symmetry condition allows a classification of such difference sets when <i>G</i> is a generalized quaternion group; for the other dicyclic groups we provide a classification where there are certain exceptions. These results have number-theoretic consequences.</p>

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

Difference Sets Disjoint from a Subgroup IV: The Skew Relative Cases with Added Symmetry

  • Andrew Haviland,
  • Stephen P. Humphries

摘要

We study finite groups G having a subgroup H and \(D \subset G {{\setminus }} H\) D G \ H such that (i) the multiset \(\{ xy^{-1}:x,y \in D\}\) { x y - 1 : x , y D } has every element that is not in H occur the same number of times (such a D is called a relative difference set); (ii) \(G=D\cup D^{(-1)} \cup H \text{(disjoint } \text{ union) }\) G = D D ( - 1 ) H (disjoint union) ; (iii) \(D \cap D^{(-1)} =\emptyset \) D D ( - 1 ) = . We show that adding an additional symmetry condition allows a classification of such difference sets when G is a generalized quaternion group; for the other dicyclic groups we provide a classification where there are certain exceptions. These results have number-theoretic consequences.