Hostname: page-component-7b7567c8c-p67k6 Total loading time: 0 Render date: 2026-11-19T19:47:27.290Z Has data issue: false hasContentIssue false

Abelian groups, graphs and generalized knights

Published online by Cambridge University Press:  24 October 2008

C. St J. A. Nash-Williams
Affiliation:
Department of MathematicsUniversity of Aberdeen
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

If g is a set of generatore of an enumerably infinite Abelian group A, it is proved that the elements of A can be arranged in both a one-ended and an endless infinite sequence in which successive terms differ by ± an element of g, except that the one-ended arrangement is impossible if g is finite and the rank of A is 1. Let ν be a cardinal number. Consider an infinite ‘chessboard’ whose positions are those lattice points of ν-dimensional space which have only finitely many non-zero coordinates. A piece associated with this chessboard is a generalized knight if every vector obtainable from a move of the piece by permuting its components and changing the signs of a subset of them is itself a permitted move. It is ascertained which positions a given generalized knight can reach in a finite sequence of moves starting at the origin, and whether or not, if it can trace out the whole chessboard in (i) a one-ended, (ii) an endless infinite sequence of moves visiting each position exactly once.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1959