Zero-nonzero tree patterns that allow

For n≥2, let Sn∗={(0,n,0),(0,n−1,1),(1,n−1,0),(n,0,0),(n−1,0,1),(n−1,1,0)}. A zero-nonzero pattern A of order n allows Sn∗ if Sn∗⊆i(A), the inertia set of A, and requires Sn∗ if Sn∗=i(A). The study...