Manuscript Oai211-A@1 · Oai211-A.tex · section · 3f3e4f63
Conditional transfer to weighted planar-map blocks
Conditional transfer to weighted planar-map blocks · lines 1256–1262
The rooted block-tree organization is standard AddarioBerry. The contract states the rooting and empty-insertion conventions actually needed here.
Nearby in this section
- section: Conditional transfer to weighted planar-map blocks
- definition: Definition: Weighted corner-substitution contract
- assumption: Assumption: Endpoint coefficient inputs
- lemma: Lemma: Quadratic inverse criterion
- section: Conditional transfer to weighted planar-map blocks
- theorem: Theorem: Exact conditional weighted representation
- section: Conditional transfer to weighted planar-map blocks