On polynomial digraphs

Simple item page
dc.creatorBrunat, Josep M.
dc.creatorMontes, Antonio
dc.date2006-01-30
dc.date2006-01-31
dc.date.accessioned2026-07-07T06:59:28Z
dc.date.available2026-07-07T06:59:28Z
dc.descriptionLet $Φ(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(Φ)$.
dc.description13 pages, 6 figures, See also http://www-ma2.upc.edu/~montes/
dc.identifierhttps://arxiv.org/abs/math/0601731
dc.identifierhttp://arxiv.org/abs/math/0601731
dc.identifierDiscrete Math. (2006), 306/4, p 401-412
dc.identifierdoi:10.1016/j.disc.2006.01.001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/107761
dc.subjectCommutative Algebra
dc.subjectCombinatorics
dc.subject05C75; 14H99; 14H05
dc.titleOn polynomial digraphs
dc.typetext

Files

Collections

arXiv