Papers by Eugenijus Manstavičius
Lithuanian Mathematical Journal, Jul 1, 1980
Bookmarks Related papers MentionsView impact
Lithuanian Mathematical Journal, Apr 1, 1982
ABSTRACT
Bookmarks Related papers MentionsView impact
arXiv (Cornell University), May 13, 2016
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Litovskij matematičeskij sbornik, Jan 15, 1972
Bookmarks Related papers MentionsView impact
De Gruyter eBooks, Dec 31, 1999
Bookmarks Related papers MentionsView impact
Publicationes Mathematicae Debrecen, Jul 1, 1994
Bookmarks Related papers MentionsView impact
Lithuanian Mathematical Journal, 1986
Bookmarks Related papers MentionsView impact
Lithuanian Mathematical Journal, 1972
The abstracts (in two languages) can be found in the pdf file of the article. Original author nam... more The abstracts (in two languages) can be found in the pdf file of the article. Original author name(s) and title in Russian and Lithuanian: Э. Манставичюс. Асимптотическое разложение законов распределения мультипликативных арифметических функций E. Manstavičius. Aritmetinių multiplikatyvinių funkcijų pasiskirstymo dėsnių asimptotinis išdėstymas
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Lithuanian Mathematical Journal, 1985
Bookmarks Related papers MentionsView impact
Lithuanian Mathematical Journal, 1997
Bookmarks Related papers MentionsView impact
Electronic Notes in Discrete Mathematics, 2017
Bookmarks Related papers MentionsView impact
Lithuanian Mathematical Journal, 1993
Bookmarks Related papers MentionsView impact
Lithuanian Mathematical Journal, 1984
Bookmarks Related papers MentionsView impact
Acta Mathematica Hungarica, 1995
Bookmarks Related papers MentionsView impact
Lithuanian Mathematical Journal, 2008
We continue our investigations on iterated logarithm laws for additive functions defined on rando... more We continue our investigations on iterated logarithm laws for additive functions defined on random combinatorial structures called assemblies or abelian partitional structures. Exploiting Feller's theorem, we obtain sharp upper bounds for a sequence of truncated additive functions. The results imply bounds for the sequence of sizes of components. The main ideas originated from the first author's number-theoretical papers.
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Uploads
Papers by Eugenijus Manstavičius