Saved in:
Bibliographic Details
Main Authors: Konyagin, Sergei V., Protasov, Vladimir Yu., Talambutsa, Alexey L.
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2502.13066
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911279236513792
author Konyagin, Sergei V.
Protasov, Vladimir Yu.
Talambutsa, Alexey L.
author_facet Konyagin, Sergei V.
Protasov, Vladimir Yu.
Talambutsa, Alexey L.
contents Using the subdivision schemes theory, we develop a criterion to check if any natural number has at most one representation in the $n$-ary number system with a set of non-negative integer digits $A=\{a_1, a_2,\ldots, a_n\}$ that contains zero. This uniqueness property is shown to be equivalent to a certain restriction on the roots of the trigonometric polynomial $\sum_{k=1}^n e^{-2πi a_k t}$. From this criterion, under a natural condition of irreducibility for $A$, we deduce that in case of prime $n$ the uniqueness holds if and only if the digits of $A$ are distinct modulo $n$, whereas for any composite $n$ we show that the latter condition is not necessary. We also establish the connection of this uniqueness to the semigroup freeness problem for affine integer functions of equal integer slope; this together with the two criteria allows to fill the gap in the work of D. Klarner on the question of P. Erdös about densities of affine integer orbits and establish a simple algorithm to check the freeness and the positivity of density when the slope is a prime number.
format Preprint
id arxiv_https___arxiv_org_abs_2502_13066
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Unique expansions in number systems via refinement equations
Konyagin, Sergei V.
Protasov, Vladimir Yu.
Talambutsa, Alexey L.
Number Theory
Discrete Mathematics
Functional Analysis
11B75, 20M05, 39A06
Using the subdivision schemes theory, we develop a criterion to check if any natural number has at most one representation in the $n$-ary number system with a set of non-negative integer digits $A=\{a_1, a_2,\ldots, a_n\}$ that contains zero. This uniqueness property is shown to be equivalent to a certain restriction on the roots of the trigonometric polynomial $\sum_{k=1}^n e^{-2πi a_k t}$. From this criterion, under a natural condition of irreducibility for $A$, we deduce that in case of prime $n$ the uniqueness holds if and only if the digits of $A$ are distinct modulo $n$, whereas for any composite $n$ we show that the latter condition is not necessary. We also establish the connection of this uniqueness to the semigroup freeness problem for affine integer functions of equal integer slope; this together with the two criteria allows to fill the gap in the work of D. Klarner on the question of P. Erdös about densities of affine integer orbits and establish a simple algorithm to check the freeness and the positivity of density when the slope is a prime number.
title Unique expansions in number systems via refinement equations
topic Number Theory
Discrete Mathematics
Functional Analysis
11B75, 20M05, 39A06
url https://arxiv.org/abs/2502.13066