2013
DOI: 10.1016/j.jpaa.2012.06.015
|View full text |Cite
|
Sign up to set email alerts
|

A characterization of Keller maps

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
6
1

Relationship

4
3

Authors

Journals

citations
Cited by 7 publications
(7 citation statements)
references
References 12 publications
0
7
0
Order By: Relevance
“…The following lemma is a natural generalization of [12], Lemma 3.1. For the proof it is enough to add the argument from the beginning of the proof of [13], Proposition 3.4.a with Q = (g).…”
Section: Analogs Of Jacobian Conditions In Terms Of Irreducible and Smentioning
confidence: 99%
See 2 more Smart Citations
“…The following lemma is a natural generalization of [12], Lemma 3.1. For the proof it is enough to add the argument from the beginning of the proof of [13], Proposition 3.4.a with Q = (g).…”
Section: Analogs Of Jacobian Conditions In Terms Of Irreducible and Smentioning
confidence: 99%
“…(i) ⇒ (ii) We combine the arguments from proofs of [12], Theorem 4.1, (i) ⇒ (ii) and [13], Theorem 3.6 (⇒). Assume that g | dgcd(f 1 , .…”
Section: Analogs Of Jacobian Conditions In Terms Of Irreducible and Smentioning
confidence: 99%
See 1 more Smart Citation
“…Let us remark that the zero characteristic analog of Theorem 4.8 for m = n ( [25], Theorem 4.1) is connected with a characterization of Keller maps and an equivalent formulation of the Jacobian Conjecture.…”
Section: Example 43 Consider Polynomialsmentioning
confidence: 99%
“…Namely, we show that in the case of the polynomial algebra, the condition (i) is also necessary, and we strengthen the condition (iv) to make it also sufficient. The crucial fact we need, to realize this aim, is the positive characteristic version of Freudenburg's lemma for polynomials, where the zero characteristic version was obtained in [11,Theorem 4.1]. Note also that a characterization of one-element -bases was obtained in [8,Theorem 4.2].…”
Section: Introductionmentioning
confidence: 99%