The combinatorial non-crossing-sums inequality
Statement
Let be odd natural numbers. For each , let be distinct real numbers, and set . For two finite pairs of real numbers, call their sums non-crossing when the two sums of one choice and the two sums of the other choice do not alternate in order. Assume:
- For each and of the same parity, the pairs and have non-crossing sums.
- For of the same parity, the three pairs , , and have non-crossing sums.
Combinatorial formulation conjecture. Then
This is an almost purely combinatorial formulation of the symmetric area inequality. It is stated as an open conjecture in the paper.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.