ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥1n\ge 1 and let x1,…,xn>0x_1,\ldots,x_n>0. For a circular arrangement represented by a cyclic permutation π\pi, and for 1≤k≤n1\le k\le n, define Sk(π)=∑i=1n∏j=0k−1xπ(i+j)S_k(\pi)=\sum_{i=1}^{n}\prod_{j=0}^{k-1}x_{\pi(i+j)}, with indices interpreted modulo nn. The conjecture asserts that the greedy circular arrangement πgr\pi_{\mathrm{gr}} simultaneously maximizes these quantities: for every circular arrangement π\pi and every k∈{1,…,n}k\in\{1,\ldots,n\}, Sk(π)≤Sk(πgr)S_k(\pi)\le S_k(\pi_{\mathrm{gr}}).

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.