Concepts3
∑MathIntermediate
Catalan Numbers
Catalan numbers count many 'non-crossing' and 'well-formed' structures like balanced parentheses, binary trees, Dyck paths, and triangulations of a convex polygon.
#catalan numbers#balanced parentheses#dyck paths+12
∑MathAdvanced
Berlekamp-Massey Algorithm
Berlekamp–Massey (BM) finds the shortest linear recurrence that exactly fits a given sequence over a field (e.g., modulo a prime).
#berlekamp-massey#linear recurrence#minimal polynomial+11
∑MathAdvanced
Linear Recurrence
A linear recurrence defines each term as a fixed linear combination of a small, fixed number of previous terms.
#linear recurrence#matrix exponentiation#kitamasa+12