Generalised polynomials and integer powers

preprint2021arXivOpen access

Abstract

We show that there does not exist a generalised polynomial which vanishes precisely on the set of powers of two. In fact, if k≥2k \geq 2 is and integer and g ⁣:N→Rg \colon \mathbb{N} \to \mathbb{R} is a generalised polynomial such that g(kn)=0g(k^n) = 0 for all n≥0n \geq 0 then there exists infinitely many m∈Nm \in \mathbb{N}, not divisible by kk, such that g(mkn)=0g(mk^n) = 0 for some n≥0n \geq 0. As a consequence, we obtain a complete characterisation of sequences which are simultaneously automatic and generalised polynomial.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.