Work

On a bounded remainder set for a digital Kronecker sequence

Year: 2018
Type: preprint
Abstract: Let ${\bf x}_0,{\bf x}_1,...$ be a sequence of points in $[0,1)^s$. A subset $S$ of $[0,1)^s$ is called a bounded remainder set if there exist two real numbers $a$ and $C$ such that, for every integer $N$, $$ | {\rm card}\{n
Language: English
Open Access status: green
OpenAlex ID: W4289082945
Cites:
Cited by:
Related to: 10