Recall the example from 2026-05-26 had
UBV=diag(I17,2)
where B is the optimal basis matrix. If we recall the congruence condition (see 2026-05-14), we get integral solutions if
Gb≡0mod2
where G is the last row of U, i.e.,
G=[0000000000000−11001].
This leads to the following question: can we find a right-hand side vector b such that Gb≡1mod2 and B−1b≥0?
Starting with the first condition, we want
b∈{x∈Z18:Gx≡1mod2}⊃{αe14+βe15+γe18:−α+β+γ≡1mod2}.
Computing B−1 gives us:
B−1=11−11−10000000000000−100−110000000000000001000000000000000000100000000000000000010000000000000000011−100000000000000000100000000000−1−11−11001−10000000000000000010000000000000000001000000000000000000100000000000000000010000000000000000000−100000000000000000.50−0.5−0.510.50000000000000.510.50.5−1−0.50000000000000101−10000000000000000010000000000000−0.5−10.5−0.500.5.
Thus,
B−1(αe14+βe15+γe18)=021α+21β−21γβ−γ−21α+21β+21γ−21α+21β−21γα−β21α−21β+21γ
This product is non-negative if and only if
α+βββ+γβαα+γ≥γ≥γ≥α≥α+γ≥β≥β(C1)(C2)(C3)(C4)(C5)(C6)
Notice that
C4∧C5C3∧C5C7∧C8C4∧C9C10∧C5⇒α≥β≥α+γ⇒γ≤0⇒β+γ≥α≥β⇒γ≥0⇒γ=0⇒β≥α⇒α=β(C7)(C8)(C9)(C10)(C11).
Therefore, we have that α=β and γ=0 are the only feasible cases. This leaves us with
b∈{αe14+βe15+γe18:−α+β+γ≡1mod2,α=β,γ=0}={αe14+αe15:−α+α≡1mod2}=∅.
Therefore, there is no right-hand side vector b, in which B is feasible and B−1b is fractional.
Conjecture: Let B be an m×m submatrix of [I−I∂−∂]. Then there are unimodular matrices U and V such that
UBV=diag(1,…,1,d1,d2,…,dj)
where d1∣d2∣⋯∣dj. Denote by Gi the row of U corresponding to di. Then the intersection
{b∈Zm:∃i where Gib≡0moddi}∩{b∈Zm:B−1b≥0}
is empty.