A remark on Penney's algorithm
Based on the well-known algorithm of W. Penney we determine the set of lengths of the canonical representation of integers with respect to the trinomial X^2m + 2X^m + 2.
arXiv subjects
Publications and source records attributed to Horst Brunotte.
Based on the well-known algorithm of W. Penney we determine the set of lengths of the canonical representation of integers with respect to the trinomial X^2m + 2X^m + 2.
The well-known expansion of rational integers in an arbitrary integer base different from $0, 1, -1$ is exploited to study relations between numerical monoids and certain subsemigroups of the multiplicative semigroup of nonzero integers.
We study the Coxeter polynomials associated with certain star-like trees. In particular, we exhibit large Salem factors of these polynomials and give convergence properties of their dominant roots.
We determine periodic and aperiodic points of certain piecewise affine maps in the Euclidean plane. Using these maps, we prove for $λ\in\{\frac{\pm1\pm\sqrt5}2,\pm\sqrt2,\pm\sqrt3\}$ that all integer sequences $(a_k)_{k\in\mathbb Z}$ satisfying $0\le a_{k-1}+λa_k+a_{k+1}<1$ are periodic.