DoF conjecture for the general 3-user $(p,p+1)$ MIMO interference channel

Consider a 3-user $(p,p+1)$ MIMO interference channel with constant channel coefficients, where each transmitter has $p$ antennas and each receiver has $p+1$ antennas. The degrees of freedom (DoF) are measured per user, and transmission uses linear filters, subspace alignment chains, symbol extensions in time, and asymmetric complex signaling (ACS). DoF conjecture for the general $(p,p+1)$ interference channel. For any $p>6$, the channel has exactly

$$\frac{p(p+1)}{2p+1}$$

DoF per user, achievable using linear transmit and receive filters together with subspace alignment chains, symbol extensions in time, and ACS. The cases $p=2,3,\ldots,6$ are proved in the paper; the conjecture extends the claimed optimal DoF to all larger values of $p$.