In communication complexity one important object is the combinatorial retangle. Given a $0-1$ square matrix $M$, do their exist permutations $sigma,pi$ such that $sigma Mpi$ consists of only geometric rectangles? That is all the combinatorial rectangles are geometrically connected?
↧