Papers
Topics
Authors
Recent
Search
2000 character limit reached

Lower bound for cyclic sums of Diananda type

Published 4 Sep 2015 in math.CA | (1509.01578v1)

Abstract: Let C=inf(k/n)i=1<sup>n</sup>xi(xi+1++xi+k)<sup>1C=\inf (k/n)\sum_{i=1}<sup>n</sup> x_i(x_{i+1}+\dots+x_{i+k})<sup>{-1}, where the infimum is taken over all pairs of integers nk1n\geq k\geq 1 and all positive x1,,xn+kx_1,\dots,x_{n+k} subject to cyclicity assumption xn+i=xix_{n+i}=x_i, i=1,,ki=1,\dots,k. We prove that $\ln 2\leq C&lt; 0.9305$. In the definition of the constant CC the operation infkinfninfx\inf_k\inf_n\inf_{\mathbf{x}} can be replaced by limklimninfx\lim_{k\to\infty}\lim_{n\to\infty}\inf_{\mathbf{x}}.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.