Computing the topological degree of polynomial maps

dc.contributor.author	Sakkalis, T	en
dc.contributor.author	Ligatsikas, Z	en
dc.date.accessioned	2014-06-06T06:43:26Z
dc.date.available	2014-06-06T06:43:26Z
dc.date.issued	1997	en
dc.identifier.issn	00049727	en
dc.identifier.uri	http://62.217.125.90/xmlui/handle/123456789/1271
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0031206337&partnerID=40&md5=698b1e8553c0015af12494c56f279b0b	en
dc.title	Computing the topological degree of polynomial maps	en
heal.type	journalArticle	en
heal.publicationDate	1997	en
heal.abstract	Let C be a cube in Rn+1 and let F = (f1, ⋯, fn+1) be a polynomial vector field. In this note we propose a recursive algorithm for the computation of the degree of F on C. The main idea of the algorithm is that the degree of F is equal to the algebraic sum of the degrees of the map (f1, f2, ⋯, fi-1, f̂i, fi+1, ⋯, fn+1) over all sides of C, thereby reducing an (n + 1)-dimensional problem to an n-dimensional one.	en
heal.journalName	Bulletin of the Australian Mathematical Society	en
dc.identifier.issue	1	en
dc.identifier.volume	56	en
dc.identifier.spage	87	en
dc.identifier.epage	94	en