ترغب بنشر مسار تعليمي؟ اضغط هنا

Generalized Jacobian Conjectures -- A purely Algebraic Approach

357   0   0.0 ( 0 )
 نشر من قبل Susumu Oda
 تاريخ النشر 2020
  مجال البحث
والبحث باللغة English
 تأليف Susumu Oda




اسأل ChatGPT حول البحث

Our goal is to settle a fading problem, the Jacobian Conjecture $(JC_n)$~: If $f_1, cdots, f_n$ are elements in a polynomial ring $k[X_1, cdots, X_n]$ over a field $k$ of characteristic zero such that $ det(partial f_i/ partial X_j) $ is a nonzero constant, then $k[f_1, cdots, f_n] = k[X_1, cdots, X_n]$. Practically, what we deal with is the generalized one, oindent The Generalized Jacobian Conjecture$(GJC)$ :{it Let $S hookrightarrow T$ be an unramified homomorphism of Noetherian domains. Assume that $S$ is a simply connected UFD ({sl i.e.,} ${rm Spec}(S)$ is simply connected and $S$ is a unique factorization domain) and that $T^times cap S = S^times$. Then $T = S$.} In addition, for consistency of the discussion, we raise some serious (or idiot) questions and some comments about the examples appeared in the papers published by the certain excellent mathematicians (though we are not willing to deal with them). However, the existence of such examples would be against our Main Result above, so that we have to dispute in Appendix B their arguments about the existence of their respective (so called) counter-examples. Our conclusion is that they are not perfect counter-examples which is shown explicitly.



قيم البحث

اقرأ أيضاً

We describe an algorithm that computes possible corners of hypothetical counterexamples to the Jacobian Conjecture up to a given bound. Using this algorithm we compute the possible families corresponding to $gcd(deg(P),deg(Q))le 35$, and all the pair s $(deg(P),deg(Q))$ with $max(deg(P),deg(Q))le 150$ for any hypothetical counterexample.
121 - Susumu Oda 2003
Let S be a polynomial ring over a field of characteristic zero in finitely may variables. Let T be an unramified, finitely generated extension of S with $T^times = k^times$. Then T = S.
We provide a number of new conjectures and questions concerning the syzygies of $mathbb{P}^1times mathbb{P}^1$. The conjectures are based on computing the graded Betti tables and related data for large number of different embeddings of $mathbb{P}^1ti mes mathbb{P}^1$. These computations utilize linear algebra over finite fields and high-performance computing.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا