ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn and kk be fixed, let R={I1,I2,…,IN}\mathcal{R}=\{I_1,I_2,\ldots,I_N\} be the lexicographically ordered set of realizable bases, and let L:R→LL:\mathcal{R}\to\mathcal{L} map each realizable basis to its corresponding closed interval, where L\mathcal{L} is the set of closed subintervals of positive length of [0,1][0,1]. For J1=[a1,b1]J_1=[a_1,b_1] and J2=[a2,b2]J_2=[a_2,b_2], write J1⪯ ⁣⋅J2J_1\mathrel{\preceq_{\!\cdot}}J_2 when b1≤a2b_1\leq a_2 or J1=J2J_1=J_2. Order-preservation conjecture. If I,I′∈RI,I'\in\mathcal{R} and I≺I′I\prec I', then

L(I)≺ ⁣⋅L(I′).L(I)\mathrel{\prec_{\!\cdot}}L(I').

Equivalently, writing L(Ii)=[ci,di]L(I_i)=[c_i,d_i], one has

0=c0<d0=c1<d1=c2<⋯=cN<dN=1.0=c_0<d_0=c_1<d_1=c_2<\cdots=c_N<d_N=1.

This conjecture asserts that the intervals associated with realizable bases occur from left to right in the same order as the bases. The paper presents it as part of the structural picture supported by the analysis and examples; no resolution is supplied.

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.