3 problems

Fixed-$\Delta$ tractability conjecture. There is a polynomial-time algorithm to solve any integer program of the form (IP) with a $\Delta$-modular constraint matrix.

Lee et al.'s conjecture. For every $cDelta,m cin cmathbb{Z}_{>0}$,

Let $\mathfrak{c}(\Delta,m)$ denote the relevant maximum column number for $\Delta$-modular integer programs, and suppose that Geelen et al.'s result gives … for some function…