The algorithm maintains a chart with entries chart b [φ] ∈ K, for each b and for each φ ∈ Φ(b).
if m is again the size of the largest Ξ σ , chart b has at most m 2|cont(b)| entries and could be thought of as an order-2|cont(b)| tensor.