An Atomic Viewpoint of the TP Completion Problem
Daniel Carter, Charles Johnson

TL;DR
This paper introduces catalysis and inhibition techniques to determine TP and TN pattern completability, providing new characterizations and obstructions, and advancing understanding of the TP completion problem with potential for automation.
Contribution
The paper presents novel techniques for pattern completion analysis, characterizes all 4-by-4 patterns, and advances the understanding of TN and TP completion relationships.
Findings
78 new obstructions for 4-by-4 patterns
Characterization of all 4-by-4 pattern completability
Partial progress on TN and TP completion conjecture
Abstract
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- case for all 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVLSI and Analog Circuit Testing · DNA and Biological Computing · semigroups and automata theory
