Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Lithuanian Mathemati...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Lithuanian Mathematical Journal
Article . 1985 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 1985
Data sources: zbMATH Open
versions View all 2 versions
addClaim

Strong convergence of additive arithmetic functions

Strong convergence of additive arithmetical functions
Authors: Manstavichyus, Eh.;

Strong convergence of additive arithmetic functions

Abstract

Given an additive function f let \(f_ k\) (k\(\geq 1)\) be the associated ''truncated'' functions defined by \(f_ k(n)=\sum_{p^ m\| n, p\leq k}f(p^ m).\) The author first characterizes those additive functions f, for which the sequence \((f_ k)\) converges strongly to f in the sense that for every \(\epsilon >0\) \[ \lim_{k\to \infty} \limsup_{x\to \infty}(1/x) \#\{n\leq x:\quad | f_ k(n)-f(n)| \geq \epsilon \}=0 ; \] the criterion for this coincides with the Erdős-Wintner criterion for the existence of a limit distribution for f. He then proves similar results involving renormalizing constants. Moreover, he proves an analogue of the law of iterated logarithm for the sequence \((f_ k)\), subject to suitable conditions on the function f.

Keywords

Arithmetic functions in probabilistic number theory, additive function, limit distribution, Asymptotic results on arithmetic functions, renormalizing constants, analogue of the law of iterated logarithm

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!