18 Sep
2013
18 Sep
'13
10:05 a.m.
This is the recurrence for Pascal's triangle. Quoting Warren D Smith <warren.wds@gmail.com>:
And Reg(N,3) = 2*(N-1) + Reg(N-1, 3)
more generally Reg(N,D) = Reg(N-1, D-1) + Reg(N-1, D) by considering adding 1 new cut-hyperplane and considering the D-1 dimensional situation within that hyperplane.