ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ff be a mapping from {1,2,…,n}\{1,2,\ldots,n\} to subsets of {1,2,…,n}\{1,2,\ldots,n\} such that

⋃i=1nf(i)={1,2,…,n}.\bigcup_{i=1}^n f(i)=\{1,2,\ldots,n\}.

For a finite set A⊆NA\subseteq\mathbb{N}, define

conv⁡f(A)={min⁡f(A),…,max⁡f(A)},\operatorname{conv}f(A)=\{\min f(A),\ldots,\max f(A)\},

the convex hull of f(A)f(A). Let I1,…,IkI_1,\ldots,I_k be any partition of {1,2,…,n}\{1,2,\ldots,n\} into consecutive blocks,

I1={1,2,…,i1},I2={i1+1,…,i2},…,Ik={ik−1+1,…,n}.I_1=\{1,2,\ldots,i_1\},\quad I_2=\{i_1+1,\ldots,i_2\},\quad \ldots,\quad I_k=\{i_{k-1}+1,\ldots,n\}.

Discrete convex-hull conjecture. There exist j∈{1,2,…,k}j\in\{1,2,\ldots,k\} and r,s∈Ijr,s\in I_j such that, for some l≤kl\leq k,

(conv⁡f)l({r,s})⊇{r,s}.(\operatorname{conv}f)^l(\{r,s\})\supseteq\{r,s\}.

The paper proposes this conjecture as a discrete statement implying the covering-system conjecture; its general status is not resolved in the supplied text.

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.