Displaying similar documents to “Symmetric Jacobians”

The Jacobian Conjecture: symmetric reduction and solution in the symmetric cubic linear case

Ludwik M. Drużkowski (2005)

Annales Polonici Mathematici

Similarity:

Let 𝕂 denote ℝ or ℂ, n > 1. The Jacobian Conjecture can be formulated as follows: If F:𝕂ⁿ → 𝕂ⁿ is a polynomial map with a constant nonzero jacobian, then F is a polynomial automorphism. Although the Jacobian Conjecture is still unsolved even in the case n = 2, it is convenient to consider the so-called Generalized Jacobian Conjecture (for short (GJC)): the Jacobian Conjecture holds for every n>1. We present the reduction of (GJC) to the case of F of degree 3 and of symmetric...

Reduction theorems for the Strong Real Jacobian Conjecture

L. Andrew Campbell (2014)

Annales Polonici Mathematici

Similarity:

Implementations of known reductions of the Strong Real Jacobian Conjecture (SRJC), to the case of an identity map plus cubic homogeneous or cubic linear terms, and to the case of gradient maps, are shown to preserve significant algebraic and geometric properties of the maps involved. That permits the separate formulation and reduction, though not so far the solution, of the SRJC for classes of nonsingular polynomial endomorphisms of real n-space that exclude the Pinchuk counterexamples...

Plane Jacobian conjecture for simple polynomials

Nguyen Van Chau (2008)

Annales Polonici Mathematici

Similarity:

A non-zero constant Jacobian polynomial map F=(P,Q):ℂ² → ℂ² has a polynomial inverse if the component P is a simple polynomial, i.e. its regular extension to a morphism p:X → ℙ¹ in a compactification X of ℂ² has the following property: the restriction of p to each irreducible component C of the compactification divisor D = X-ℂ² is of degree 0 or 1.

Discrete-time symmetric polynomial equations with complex coefficients

Didier Henrion, Jan Ježek, Michael Šebek (2002)

Kybernetika

Similarity:

Discrete-time symmetric polynomial equations with complex coefficients are studied in the scalar and matrix case. New theoretical results are derived and several algorithms are proposed and evaluated. Polynomial reduction algorithms are first described to study theoretical properties of the equations. Sylvester matrix algorithms are then developed to solve numerically the equations. The algorithms are implemented in the Polynomial Toolbox for Matlab.

Reducibility of Symmetric Polynomials

A. Schinzel (2005)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

A necessary and sufficient condition is given for reducibility of a symmetric polynomial whose number of variables is large in comparison to degree.

Triangularization properties of power linear maps and the Structural Conjecture

Michiel de Bondt, Dan Yan (2014)

Annales Polonici Mathematici

Similarity:

We discuss several additional properties a power linear Keller map may have. The Structural Conjecture of Drużkowski (1983) asserts that certain two such properties are equivalent, but we show that one of them is stronger than the other. We even show that the property of linear triangularizability is strictly in between. Furthermore, we give some positive results for small dimensions and small Jacobian ranks.