Summary
The paper deals with the behaviour of the so-called “algorithms with respect to interval filling sequences” A connection is established between the uniquely representable points and the continuity points of the algorithms; also strong continuity properties on monotonic algorithms are proved. Finally the results are applied to additive functions. The theorems extend some former results by the authors, by I. Kátai and by A. Járai.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Daróczy, Z., Járai, A. andKátai, I., Intervallfüllende Folgen and volladditive Funktionen. Acta Sci. Math.52 (1988), 337–350.
Daróczy, Z. andKátai, I.,Interval filling sequences and additive functions. Acta Sci. Math.52 (1988), 337–347.
Daróczy, Z., Kátai I. andSzabó, T.,On completely additive functions related to interval filling sequences. Arch. Math.54 (1990), 173–179.
Author information
Authors and Affiliations
Additional information
Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth
Rights and permissions
About this article
Cite this article
Daróczy, Z., Maksa, G. & Szabó, T. Some regularity properties of algorithms and additive functions with respect to them. Aeq. Math. 41, 111–118 (1991). https://doi.org/10.1007/BF02227446
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02227446