2014
DOI: 10.1016/j.bulsci.2013.05.006
|View full text |Cite
|
Sign up to set email alerts
|

Effective calculations of the multiplicity of polynomial mappings

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2016
2016
2017
2017

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…In summary, we can find effectively i 0 (f ) and deg 0 f (C n ) in (11). Hence the third number in (11) can be effectively determined.…”
Section: Proof Of the Main Theoremmentioning
confidence: 97%
See 1 more Smart Citation
“…In summary, we can find effectively i 0 (f ) and deg 0 f (C n ) in (11). Hence the third number in (11) can be effectively determined.…”
Section: Proof Of the Main Theoremmentioning
confidence: 97%
“…In this Section we give effective method to calculate the number d(f ) in (11). Let I f be the ideal of the graph of the mapping f , i.e.…”
Section: Proof Of the Main Theoremmentioning
confidence: 99%
“…The proof is based on an algorithm which allows us to effectively compute the multiplicity i 0 (f ) (Theorem 4, cf. [10]). As a corollary we get the above-mentioned semicontinuity theorem (Corollary 11).…”
mentioning
confidence: 99%