The Gordon Game of a Finite Group (Q5285738)

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 222787
Language Label Description Also known as
default for all languages
No label defined
    English
    The Gordon Game of a Finite Group
    scientific article; zbMATH DE number 222787

      Statements

      The Gordon Game of a Finite Group (English)
      0 references
      29 June 1993
      0 references
      game of sequencing
      0 references
      finite group
      0 references
      Gordon game
      0 references
      0 references
      This note concerns a game of ``sequencing'' in a finite group \(G\). Two players choose elements \(x_ n\) of \(G\) alternately, starting with \(x_ 1=e\); neither a position \(x_ n\) nor a step \(x_ n x_{n-1}^{-1}\) may be repeated. The first player unable to move loses. Sampling and a heuristic argument are offered for the conjecture: For almost all primes \(p\), the Gordon game on \(Z_ p\) is a win for the second player.
      0 references

      Identifiers