Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
