Manuscript En08-A@1 · En08-A.tex · section · c688d76d

Iteration

Reachability sums and affine cone representations › Iteration · lines 901–911

En08-A@1#eq:recurrence

Let $R_{n} (e)$ be the endpoints of paths of exactly $n$ edges, with $R_{0} (e) = {e}$ . Then

R_{n + 1} (e) = v \in R_{n} (e) ⋃ R_{1} (v) .

For at most $n$ edges use $R_{\leq n} (e) = ⋃_{k = 0}^{n} R_{k} (e)$ . These notions differ unless waiting has been specified.

Displayed formulas in this passage

En08-A@1#eq:recurrence · line 905
$R_{n + 1} (e) = v \in R_{n} (e) ⋃ R_{1} (v) .$