On polynomial digraphs
Abstract
Let (x,y) be a bivariate polynomial with complex coefficients. The zeroes of (x,y) are given a combinatorial structure by considering them as arcs of a directed graph G(). This paper studies some relationship between the polynomial (x,y) and the structure of G().
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.