Recall that a homology class is said to have torsion if there is an integer such that , i.e, there is a chain such that . I claim that being torsion-free is a necessary condition for the OHCP LP giving integral solutions.
Assume that there is some and chain such that . Then notice that letting gives
which has a cost of
Thus, is the optimal solution and is fractional.
Recall from 2026-05-07 that it appears that where
Thus, it follows that if and only if , i.e., . This leads the question, what condition results in laying the 0 coset?
Assume that such that and . Then for some . Moreover, it follows that
Thus, whenever
Unfortunately, numerical experiments show that which would have directly shown that if and only if . That being said, this result also does not disprove the claim.
Take the following instance:
Testing B_5808.txt
- G[\partial]
<Compressed Sparse Row sparse matrix of dtype 'int64'
with 26 stored elements and shape (1, 444)>
Coords Values
(0, 0) 2
(0, 3) -2
(0, 27) -2
(0, 29) -2
(0, 125) 1
(0, 130) 1
(0, 131) -1
(0, 137) -1
(0, 141) 1
(0, 142) -2
(0, 143) 1
(0, 152) 1
(0, 154) 1
(0, 155) -2
(0, 160) -2
(0, 163) 1
(0, 165) -1
(0, 183) 2
(0, 185) -2
(0, 221) 2
(0, 222) 2
(0, 226) 2
(0, 228) -2
(0, 244) 2
(0, 249) 2
(0, 250) -2
What happens if we set where ? If the same basis was encountered, then which would imply that we do not get an integral solution despite . However, there is no guarantee that the same basis would be encountered. Upon testing, setting as the input gave a different set of basis matrices encountered. In fact, further testing shows that
but , i.e., is not a feasible basis for .
Conjecture: Let in which . Then for any feasible basis of in which is a feasible basis of , it follows that
Consequently, .
The above can be thought of as the following conditions
- imply that .
Consider the following cone
which consists of all right-hand side vectors such that is a feasible basis. From experimentation, we know that is possible for with but . But, does it follow that if , then ? Note that if , then it follows that , but it may be the case that .
Define
Then we need that for all . Note that if , then we get for free. Indeed,
if and only if as and is unimodular.
Right now our only known sufficient condition is that where
We also know that the cone
does not contain homology classes. That is, and does not imply that . Notice that because it follows that where
Recall that . Thus it follows that
which is likely huge. Numerical tests put this upper bound at least . This is an upper bound, we would like a lower bound.
We can slightly improve this condition. Let be the bases visited during simplex method. Define
where when . Then the condition becomes that
where the modulo congruence is done entry-wise. Notice that is true if and only if for some . Thus we may define the system
which we denote in short form by . From, here we get that