Interval filling sequences and completely additive functions (Q1187315)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Interval filling sequences and completely additive functions |
scientific article; zbMATH DE number 39081
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Interval filling sequences and completely additive functions |
scientific article; zbMATH DE number 39081 |
Statements
Interval filling sequences and completely additive functions (English)
0 references
28 June 1992
0 references
Let \(\lambda_ 1>\lambda_ 2>\cdots>\lambda_ n>\cdots>0\) be real numbers with \(\sum^{+\infty}_{n=1}\lambda_ n=L<+\infty\). The sequence \(\lambda_ n\), \(n\geq 1\) is called interval filling if, for every \(x\in[0,L]\), there are digits \(e_ n=0\) or 1 with \(x=\sum^{+\infty}_{n=1}e_ n\lambda_ n\). The function \(F(x)\), \(0\leq x\leq L\), is called completely additive with respect to \(\lambda_ n\), \(n\geq 1\), if \(F(x)=\sum^{+\infty}_{n=1}e_ nF(\lambda_ n)\). Upon studying the structure of interval filling sequences, the author finds general criteria on \(\lambda_ n\) implying that completely additive functions are linear. This extends earlier results of \textit{Z. Daróczy}, \textit{A. Járai} and \textit{I. Kátai} [Acta Sci. Math. 50, 337-350 (1986; Zbl 0619.10007)] who studied the special case \(\lambda_ n=q^{-n}\), \(n\geq 1\), \(1<q<2\).
0 references
functional equation
0 references
unique linear solution
0 references
structure of interval filling sequences
0 references
completely additive functions
0 references