For plane graphs of contravening decomposition stars, isomorphism to one in the Hal05 dataset implies isomorphism to the plane graph of either the pentahedral prism, hcp or fcc. An Interpretation I of a linear programming problem (LP) is a nonempty set |I| with assignment xi→xiI, xiI: |I| → ℝ to xi. Ax ≤ b is satisfied under I if AxI(p) ≤ b ∀ p ∈ |I|. The interpretation I is a relaxation of the nonlinear program (NLP) if
- P = |I|
- The constraints are satisfied under the interpretation
- f(p) ≤ cxI(p) ∀ p ∈ |I|
(LP) with relaxation I to (NLP) has a feasible solution. If (LP) is bounded above by a constant M, then M is an upper bound of the function f: |I| → ℝ. For a tame plane graph G, DS(G) the space of all decomposition stars whose associated plane graph is isomorphic to G. For every tame plane graph G other than Gfcc, Ghcp, Gpent, there is a finite sequence of linear programs where
- Every linear program has an admissible solution, strictly less than 8 pt.
- For (LP) in this sequence, its interpretation I which is a relaxation of the nonlinear optimization problem σ: |I| → ℝ, where |I| is a subset of DS(G)
- The union of the subsets |I| over the sequence of LPs is DS(G)
If a tame graph G is not isomorphic to the above graphs, it's not contravening. A contravening decomposition star D and tame graph G, has an exact correspondence between all faces of G to standard regions of D. No standard region of D has any enclosed vertices from U(D). Assuming a pentagonal standard region R with enclosed vertex v of height at most 2t0. If
- |vi| ≤ 2.168 for each corner
- Each interior angle is at most 2.89
- consecutive corners vi = 1, 2, 3 form |v1 - v2| + |v2 - v3| < 4.804
- Σ5|vi - vi+1| ≤ 11.407
then σR(D) < -0.2345 or τR(D) > 0.6079