On polynomial digraphs
classification
🧮 math.AC
math.CO
keywords
polynomialstructurearcsbivariatecoefficientscombinatorialcomplexconsidering
read the original abstract
Let $\Phi(x,y)$ be a bivariate polynomial with complex coefficients. The zeroes of $\Phi(x,y)$ are given a combinatorial structure by considering them as arcs of a directed graph $G(\Phi)$. This paper studies some relationship between the polynomial $\Phi(x,y)$ and the structure of $G(\Phi)$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.