<p>A complete mapping of a group <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <mi>G</mi> </math></EquationSource> <EquationSource Format="TEX">$G$</EquationSource> </InlineEquation> is a bijection <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq2.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="81" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <mi>ϕ</mi> <mo>:</mo> <mi>G</mi> <mo stretchy="false">→</mo> <mi>G</mi> </math></EquationSource> <EquationSource Format="TEX">$\phi \colon G\to G$</EquationSource> </InlineEquation> such that <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="79" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <mi>x</mi> <mo>↦</mo> <mi>x</mi> <mi>ϕ</mi> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </math></EquationSource> <EquationSource Format="TEX">$x\mapsto x\phi (x)$</EquationSource> </InlineEquation> is also bijective. Hall and Paige conjectured in 1955 that a finite group <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq4.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <mi>G</mi> </math></EquationSource> <EquationSource Format="TEX">$G$</EquationSource> </InlineEquation> has a complete mapping whenever <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq5.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="57" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <msub> <mo movablelimits="false">∏</mo> <mrow> <mi>x</mi> <mo>∈</mo> <mi>G</mi> </mrow> </msub> <mi>x</mi> </math></EquationSource> <EquationSource Format="TEX">$\prod _{x\in G} x$</EquationSource> </InlineEquation> is the identity in the abelianization of <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq6.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <mi>G</mi> </math></EquationSource> <EquationSource Format="TEX">$G$</EquationSource> </InlineEquation>. This was confirmed in 2009 by Wilcox, Evans, and Bray with a proof using the classification of finite simple groups. In this paper, we give a combinatorial proof of a far-reaching generalisation of the Hall-Paige conjecture for large groups. We show that for random-like and equal-sized subsets <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq7.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="17" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <mi>A</mi> </math></EquationSource> <EquationSource Format="TEX">$A$</EquationSource> </InlineEquation>, <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq8.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="17" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <mi>B</mi> </math></EquationSource> <EquationSource Format="TEX">$B$</EquationSource> </InlineEquation>, <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq9.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="17" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <mi>C</mi> </math></EquationSource> <EquationSource Format="TEX">$C$</EquationSource> </InlineEquation> of a group <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq10.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <mi>G</mi> </math></EquationSource> <EquationSource Format="TEX">$G$</EquationSource> </InlineEquation>, there exists a bijection <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq11.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="80" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <mi>ϕ</mi> <mo>:</mo> <mi>A</mi> <mo stretchy="false">→</mo> <mi>B</mi> </math></EquationSource> <EquationSource Format="TEX">$\phi \colon A\to B$</EquationSource> </InlineEquation> such that <InlineEquation ID="IEq12"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq12.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="79" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <mi>x</mi> <mo>↦</mo> <mi>x</mi> <mi>ϕ</mi> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </math></EquationSource> <EquationSource Format="TEX">$x\mapsto x\phi (x)$</EquationSource> </InlineEquation> is a bijection from <InlineEquation ID="IEq13"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq13.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="17" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <mi>A</mi> </math></EquationSource> <EquationSource Format="TEX">$A$</EquationSource> </InlineEquation> to <InlineEquation ID="IEq14"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq14.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="17" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <mi>C</mi> </math></EquationSource> <EquationSource Format="TEX">$C$</EquationSource> </InlineEquation> whenever <InlineEquation ID="IEq15"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq15.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="178" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <msub> <mo movablelimits="false">∏</mo> <mrow> <mi>a</mi> <mo>∈</mo> <mi>A</mi> </mrow> </msub> <mi>a</mi> <msub> <mo movablelimits="false">∏</mo> <mrow> <mi>b</mi> <mo>∈</mo> <mi>B</mi> </mrow> </msub> <mi>b</mi> <mo>=</mo> <msub> <mo movablelimits="false">∏</mo> <mrow> <mi>c</mi> <mo>∈</mo> <mi>C</mi> </mrow> </msub> <mi>c</mi> </math></EquationSource> <EquationSource Format="TEX">$\prod _{a\in A} a \prod _{b\in B} b=\prod _{c\in C} c$</EquationSource> </InlineEquation> in the abelianization of <InlineEquation ID="IEq16"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq16.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <mi>G</mi> </math></EquationSource> <EquationSource Format="TEX">$G$</EquationSource> </InlineEquation>. We use this statement as a black-box to settle the following old problems in combinatorial group theory for large groups. (1) We characterise sequenceable groups, that is, groups which admit a permutation <InlineEquation ID="IEq17"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq17.gif" Format="GIF" Height="10" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <mi>π</mi> </math></EquationSource> <EquationSource Format="TEX">$\pi $</EquationSource> </InlineEquation> of their elements such that the partial products <InlineEquation ID="IEq18"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq18.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="17" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <msub> <mi>π</mi> <mn>1</mn> </msub> </math></EquationSource> <EquationSource Format="TEX">$\pi _{1}$</EquationSource> </InlineEquation>, <InlineEquation ID="IEq19"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq19.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="33" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <msub> <mi>π</mi> <mn>1</mn> </msub> <msub> <mi>π</mi> <mn>2</mn> </msub> </math></EquationSource> <EquationSource Format="TEX">$\pi _{1}\pi _{2}$</EquationSource> </InlineEquation>, <InlineEquation ID="IEq20"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq20.gif" Format="GIF" Height="13" Rendition="HTML" Resolution="72" Type="Linedraw" Width="77" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <msub> <mi>π</mi> <mn>1</mn> </msub> <msub> <mi>π</mi> <mn>2</mn> </msub> <mo>⋯</mo> <msub> <mi>π</mi> <mi>n</mi> </msub> </math></EquationSource> <EquationSource Format="TEX">$\pi _{1}\pi _{2}\cdots \pi _{n}$</EquationSource> </InlineEquation> are all distinct. This resolves a problem of Gordon from 1961 and confirms conjectures made by several authors, including Keedwell’s 1981 conjecture that all large non-abelian groups are sequenceable. We also characterise the related <InlineEquation ID="IEq21"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="222_2025_1328_Article_IEq21.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <mi>R</mi> </math></EquationSource> <EquationSource Format="TEX">$R$</EquationSource> </InlineEquation>-sequenceable groups, addressing a problem of Ringel from 1974. (2) We confirm in a strong form a conjecture of Snevily from 1999 by characterising large subsquares of multiplication tables of finite groups that admit transversals. Previously, this characterisation was known only for abelian groups of odd order (by a combination of papers by Alon and Dasgupta-Károlyi-Serra-Szegedy and Arsovski). (3) We characterise the abelian groups that can be partitioned into zero-sum sets of specific sizes, solving a problem of Tannenbaum from 1981. This also confirms a recent conjecture of Cichacz. (4) We characterise harmonious groups, that is, groups with an ordering in which the product of each consecutive pair of elements is distinct, solving a problem of Evans from 2015.</p>

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

A random Hall-Paige conjecture

  • Alp Müyesser,
  • Alexey Pokrovskiy

摘要

A complete mapping of a group G $G$ is a bijection ϕ : G G $\phi \colon G\to G$ such that x x ϕ ( x ) $x\mapsto x\phi (x)$ is also bijective. Hall and Paige conjectured in 1955 that a finite group G $G$ has a complete mapping whenever x G x $\prod _{x\in G} x$ is the identity in the abelianization of G $G$ . This was confirmed in 2009 by Wilcox, Evans, and Bray with a proof using the classification of finite simple groups. In this paper, we give a combinatorial proof of a far-reaching generalisation of the Hall-Paige conjecture for large groups. We show that for random-like and equal-sized subsets A $A$ , B $B$ , C $C$ of a group G $G$ , there exists a bijection ϕ : A B $\phi \colon A\to B$ such that x x ϕ ( x ) $x\mapsto x\phi (x)$ is a bijection from A $A$ to C $C$ whenever a A a b B b = c C c $\prod _{a\in A} a \prod _{b\in B} b=\prod _{c\in C} c$ in the abelianization of G $G$ . We use this statement as a black-box to settle the following old problems in combinatorial group theory for large groups. (1) We characterise sequenceable groups, that is, groups which admit a permutation π $\pi $ of their elements such that the partial products π 1 $\pi _{1}$ , π 1 π 2 $\pi _{1}\pi _{2}$ , π 1 π 2 π n $\pi _{1}\pi _{2}\cdots \pi _{n}$ are all distinct. This resolves a problem of Gordon from 1961 and confirms conjectures made by several authors, including Keedwell’s 1981 conjecture that all large non-abelian groups are sequenceable. We also characterise the related R $R$ -sequenceable groups, addressing a problem of Ringel from 1974. (2) We confirm in a strong form a conjecture of Snevily from 1999 by characterising large subsquares of multiplication tables of finite groups that admit transversals. Previously, this characterisation was known only for abelian groups of odd order (by a combination of papers by Alon and Dasgupta-Károlyi-Serra-Szegedy and Arsovski). (3) We characterise the abelian groups that can be partitioned into zero-sum sets of specific sizes, solving a problem of Tannenbaum from 1981. This also confirms a recent conjecture of Cichacz. (4) We characterise harmonious groups, that is, groups with an ordering in which the product of each consecutive pair of elements is distinct, solving a problem of Evans from 2015.