title: Blocks of non-contradicting n-tupels
body: <p>I would like to efficiently compute a boolean matrix that stores all non-contradicting pairings over a large set of n-tupels with possible empty fields, for example:</p>
  
  <pre><code>(1,None,44,22,44,None,33,)
  
  (1,24,None,None,None,23,33,)
  </code></pre>
  
  <p>These two tupels do <strong>not</strong> contradict each other.</p>
  
  <p>Ultimately, I am looking for <em>python</em> code, but this is more about the general idea and I have a feeling there should be some matrix operations that enable this - or a simple tree structure. The tricky part is that an empty value <code>None</code> is not contradicting any given value.</p>