ConceptMathematics
Geronimus polynomials
A sequence of orthogonal polynomials that, when evaluated at the adjacency matrix of a k-regular graph, count the number of non-backtracking walks of a specific length.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Adjacency matrix1Orthogonal polynomials1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.