English

Fixed point sets in digital topology, 1

General Topology 2019-02-01 v1 Combinatorics

Abstract

In this paper, we examine some properties of the fixed point set of a digitally continuous function. The digital setting requires new methods that are not analogous to those of classical topological fixed point theory, and we obtain results that often differ greatly from standard results in classical topology. We introduce several measures related to fixed points for continuous self-maps on digital images, and study their properties. Perhaps the most important of these is the fixed point spectrum F(X)F(X) of a digital image: that is, the set of all numbers that can appear as the number of fixed points for some continuous self-map. We give a complete computation of F(Cn)F(C_n) where CnC_n is the digital cycle of nn points. For other digital images, we show that, if XX has at least 4 points, then F(X)F(X) always contains the numbers 0, 1, 2, 3, and the cardinality of XX. We give several examples, including CnC_n, in which F(X)F(X) does not equal {0,1,,#X}\{0,1,\dots,\#X\}. We examine how fixed point sets are affected by rigidity, retraction, deformation retraction, and the formation of wedges and Cartesian products. We also study how fixed point sets in digital images can be arranged; e.g., in some cases the fixed point set is always connected.

Keywords

Cite

@article{arxiv.1901.11093,
  title  = {Fixed point sets in digital topology, 1},
  author = {Laurence Boxer and P. Christopher Staecker},
  journal= {arXiv preprint arXiv:1901.11093},
  year   = {2019}
}

Comments

25 pages, 7 superlative figures

R2 v1 2026-06-23T07:27:38.549Z