English

Sparse matrices describing iterations of integer-valued functions

Combinatorics 2014-11-04 v1

Abstract

We consider iterations of integer-valued functions ϕ\phi, which have no fixed points in the domain of positive integers. We define a local function ϕn\phi_n, which is a sub-function of ϕ\phi being restricted to the subdomain {0,...,n}\{0, ..., n \}. The iterations of ϕn\phi_n can be described by a certain n×nn \times n sparse matrix MnM_n and its powers. The determinant of the related n×nn \times n matrix M^n=IMn\hat{M}_n = I - M_n, where II is the identity matrix, acts as an indicator, whether the iterations of the local function ϕn\phi_n enter a cycle or not. If ϕn\phi_n has no cycle, then detM^n=1\det \hat{M}_n = 1 and the structure of the inverse M^n1\hat{M}_n^{-1} can be characterized. Subsequently, we give applications to compute the inverse M^n1\hat{M}_n^{-1} for some special functions. At the end, we discuss the results in connection with the 3x+13x+1 and related problems.

Keywords

Cite

@article{arxiv.1411.0590,
  title  = {Sparse matrices describing iterations of integer-valued functions},
  author = {Bernd C. Kellner},
  journal= {arXiv preprint arXiv:1411.0590},
  year   = {2014}
}

Comments

19 pages

R2 v1 2026-06-22T06:46:15.899Z