ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P=(T;U,V)P=(T;U,V) be a 3M-DAP. Write t,u,vt,u,v for the relevant row lengths, st,su,svs_t,s_u,s_v for the numbers of rows of types T,U,VT,U,V, and xt,xu,xvx_t,x_u,x_v for their total values. A (T,V)(T,V)-pair consists of subsets of TT- and VV-rows with sizes aa and bb.

Type-1 zero-problem conjecture. If st≤(v−1)svs_t\leq(v-1)s_v, then the optimal solution consists of (T,V)(T,V)-pairs with a/b=st/sva/b=s_t/s_v, with (T,V)(T,V) itself being one such pair, and the optimal value is

stxt−svxvstt−svv=xuu,\frac{s_tx_t-s_vx_v}{s_tt-s_vv}=\frac{x_u}{u},

i.e. all values in UU must be xu/ux_u/u.

The source presents this as a conjecture about the structure and value of optimal solutions for this class of 3M-DAPs. No resolution is supplied in the stated context.

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.