n:
. r
n 
(G:({s:(n List)| ||s|| = k 
& (x,y:||s||. x < y s[x] < s[y]) }
||L||). 
c:||L||, f:(L[c]n). increasing(f;L[c]) & (s:L[c] List. ||s|| = k (x,y:||s||. x < y s[x] < s[y]) G(map(f;s)) = c))
nil ; a.as' [(f(a)) / map(f;as')] (recursive)
is mentioned by
| Def r- > L^k == n:. rn (G:({s:(n List)| ||s|| = k & (x,y:||s||. x < y s[x] < s[y]) }||L||). c:||L||, f:(L[c]n). increasing(f;L[c]) & (s:L[c] List. ||s|| = k (x,y:||s||. x < y s[x] < s[y]) G(map(f;s)) = c)) | [arrows] |
In prior sections: list 1 mb list 1 mb list 2 graph 1 1
Try larger context:
Graphs