Related papers: A new method in the Jacobian Conjecture
In this paper, we study a so-called Condition C1 and a weaker Condition C2. For Druzkowski maps Condition C2 is equivalent to the Jacobian conjecture. Main results obtained: - Stating new equivalent formulations of the Jacobian conjecture.…
Any counterexample to the two-dimensional Jacobian Conjecture gives a rational map from one projective plane to another. We use some ideas of the Minimal Model Program to study the combinatorial structure of a rational surface, that is…
Based on the reduction of degree in polynomial mappings and some known results in algebraic geometry, by introducing the Brouwer degree, a tool from differential topology, algebraic topology and algebraic geometry, we completely prove the…
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…
The said paper [2] entitled "Proof Of Two Dimensional Jacobian Conjecture" is with gaps.
The two dimensional Jacobian Conjecture says that a morphism $f:\mathbb{C}[x,y]\to \mathbb{C}[x,y]$ having an invertible Jacobian, is invertible. We show that a morphism $f$ having an invertible Jacobian is invertible, in each of the…
The Jacobian Conjecture uses the equation $det(Jac(F))\in k^*$, which is a very short way to write down many equations putting restrictions on the coefficients of a polynomial map $F$. In characteristic $p$ these equations do not suffice to…
New cases of the multiplicity conjecture are considered.
In this short note we report on results on a computational search for a counterexample to the strong coincidence conjecture. In particular, we discuss the method used so that further searches can be conducted.
We present here a new method for evaluating determinants -- the reduction method. Firstly, in the section 2, we apply it to third-order determinants and after, in the section 3, we generalize it to higher-order determinants. In the section…
The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas. To further demonstrate its power and elegance we exhibit new simple proofs using the incompressibility method.
Jacobian conjecture states that if $F:\ \mathbb C^n(\mathbb R^n)\rightarrow \mathbb C^n(\mathbb R^n)$ is a polynomial map such that the Jacobian of $F$ is a nonzero constant, then $F$ is injective. This conjecture is still open for all…
The Jacobian Conjecture has been reduced to the symmetric homogeneous case. In this paper we give an inversion formula for the symmetric case and relate it to a combinatoric structure called the Grossman-Larson Algebra. We use these tools…
The purpose of this review paper is the collection, systematization and discussion of recent results concerning the quantization approach to the Jacobian conjecture, as well as certain related topics.
We prove the Strong Jacobi Bound Conjecture for generically reduced components of differential schemes.
The Newton polytope related to a ``minimal" counterexample to the Jacobian conjecture is introduced and described. This description allows to obtain a sharper estimate for the geometric degree of the polynomial mapping given by a Jacobian…
This is a tutorial introduction to the representation theory of SU(2) with emphasis on the occurrence of Jacobi polynomials in the matrix elements of the irreducible representations. The last section traces the history of the insight that…
In order to avoid the evaluation of the Jacobian matrix and its inverse, the present author recently introduced the pseudo-Jacobian matrix with a general applicability of any nonlinear systems of equations. By using this concept, this paper…
Using the author's inversion formula for automorphisms of the Weyl algebras with polynomial coefficients and the bound on its degree a slightly shorter (algebraic) proof is given of the result of A. Belov-Kanel and M. Kontsevich that the…
A new family of $n$-dimensional solutions of the Jacobi identities is characterized. Such a family is very general, thus unifying in a common framework many different well-known Poisson systems seemingly unrelated. This unification is not…