ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n,L,d≥2n,L,d\geq 2 be integers, let fdf_d be the polynomial

fd(x)=∑(e1,…,ed)∈Ed∏i=1dxei∣e1∪⋯∪ei∣,f_d(x)=\sum_{(e_1,\ldots,e_d)\in E^d}\prod_{i=1}^{d}\frac{x_{e_i}}{\lvert e_1\cup\cdots\cup e_i\rvert},

and let Δm\Delta_m be the simplex on which it is defined. Convexity conjecture. The polynomial fdf_d is convex over the simplex Δm\Delta_m. This conjecture would give a positive answer to the question of whether fdf_d attains its minimum on Δm\Delta_m at the barycenter, since a convex function with the relevant symmetry has that property. The source provides no resolution of the conjecture.

Record

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.