2000 character limit reached
Lower bound for cyclic sums of Diananda type
Published 4 Sep 2015 in math.CA | (1509.01578v1)
Abstract: Let , where the infimum is taken over all pairs of integers and all positive subject to cyclicity assumption , . We prove that $\ln 2\leq C< 0.9305$. In the definition of the constant the operation can be replaced by .
Paper Prompts
Sign up for free to create and run prompts on this paper.