An atomic viewpoint of the TP completion problem.

We present two complementary techniques called catalysis and inhibition which allow one to determine if a given pattern is TP completable or TP non-completable, respectively. Empirically, these techniques require considering only one unspecified entry at a time in a vast majority of cases, which makes these techniques ripe for automation and a powerful framework for future work in the TP completion problem. With small modifications, these techniques are also applicable to the TN completion problem. We provide two major applications. First, we characterize all 4-by-4 patterns by completability. There are a total of 78 new obstructions of this size, six times as many as the 3-by- n case for all n combined. Second, we provide a characterization of the so-called 1-variable obstructions in the TN case, which includes as a corollary a characterization of patterns with a single unspecified entry. This also provides a novel partial result towards proving the conjecture that all TN-completable patterns are TP-completable. [ABSTRACT FROM AUTHOR]