Elusive groups from non-split extensions (Q7229455)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8186946
Language Label Description Also known as
default for all languages
No label defined
    English
    Elusive groups from non-split extensions
    scientific article; zbMATH DE number 8186946

      Statements

      Elusive groups from non-split extensions (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      15 April 2026
      0 references
      A theorem of Jordan states that every finite transitive permutation group on at least two points has a derangement. This was strengthened by \textit{B. Fein} et al. [J. Reine Angew. Math. 328, 39--57 (1981; Zbl 0457.13004)] who proved that every finite transitive permutation group has a derangement of prime power order. A finite transitive permutation group is called elusive if it contains no derangement of prime order. These groups are related to an open problem in algebraic graph theory known as the Polycirculant Conjecture which asserts that no elusive group is \(2\)-closed.\N\NThe set \(E\) of degrees of elusive groups is considered. It is asked whether \(E\) has density \(0\) in \(\mathbb{N}\). It is proved that for each Mersenne prime \(p \geq 7\) and integer \(k \geq 2\), there exists an elusive group of degree \(p^{3k-4}(p+1)/2\). It is also shown that there are elusive groups of odd degree and twice odd degree, namely \(3^{k+1} \cdot 5^{2}\) and \(2 \cdot 3^{k+1} \cdot 5^{2}\) for every integer \(k \geq 1\).\N\NThe paper initiates the construction of elusive groups as non-split extensions of finite groups.
      0 references
      elusive group
      0 references
      non-split extension
      0 references
      polycirculant conjecture
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers