Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-20T08:35:48.677Z Has data issue: false hasContentIssue false
  • English
  • Français

Abelian groups, graphs and generalized knights

Published online by Cambridge University Press:  24 October 2008

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

Abstract

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.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 55 , Issue 3 , July 1959 , pp. 232 - 238
Copyright
Copyright © Cambridge Philosophical Society 1959

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Künig, D.Theorie der endlichen und unendlichen Graphen (Leipzig, 1936).Google Scholar
(2)Kurosh, A. G.The theory of groups (1952), translated from the Russian and edited by Hirsch, K. A., vol. 1 (New York, 1955).Google Scholar
(3)Kürschák, J.Lóugras a végtelen sakktáblán (Knight's moves on the infinite chessboard). Math. phys. Lapok, 33 (1926), 117–19 (Hungarian).Google Scholar
(4)Kürschák, J.Rösselsprung auf dem unendlichen Schachbrette. Acta Univ. Szeged, 4 (1928–1929), 12–13.Google Scholar
(5)Sabidussi, G.Graphs with given group and given graph-theoretical properties. Canad. J. Math. 9 (1957), 515–25.CrossRefGoogle Scholar
(6)Vázsonyi, E.Über Gitterpunkte des mehrdimensionalen Raumes. Acta Univ. Szeged, Sci. Math. 9 (1938–1940), 163–73.Google Scholar