Lower bound for cyclic sums with one-sided maximal averages in denominators
Sergey Sadov

TL;DR
This paper establishes the asymptotic behavior of the minimal cyclic sums involving one-sided averages in denominators, generalizing previous sums and providing precise growth rates as the number of terms increases.
Contribution
It derives the asymptotic formula for the lower bounds of cyclic sums with variable averaging lengths, extending known results for specific sum types.
Findings
Asymptotic lower bounds grow as e log n minus a constant
Generalizes Shapiro and Diananda sums to variable r_i sums
Provides precise asymptotic behavior as n approaches infinity
Abstract
Let be an -tuple of positive real numbers and the sequence be its -periodic extension. Given an -tuple of positive integers, let be the arithmetic mean of . We form the cyclic sums , following the pattern of the long studied Shapiro sums, which correspond to all , and more general Diananda sums, where all are equal. We find the asymptotics of the -independent lower bounds as : it is .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Mathematical Approximation and Integration
