STRUCTURE OF KELLER MAPPINGS, TWO-DIMENSIONAL CASE
Journal Title: Проблемы анализа-Issues of Analysis - Year 2017, Vol 6, Issue 1
Abstract
A Keller map is a polynomial mapping ƒ : Rⁿ → Rⁿ (or Cⁿ → Cⁿ) with the Jacobian Jƒ ≡ const ≠ 0. The Jacobian conjecture was first formulated by O. N. Keller in 1939. In the modern form it supposes injectivity of a Keller map. Earlier, in the case n = 2, the author gave a complete description of Keller maps with deg ƒ ≤ 3. This paper is devoted to the description of Keller maps for which deg ƒ ≤ 4. Significant differences between these two cases are revealed, which, in particular, indicate the irregular structure of Keller maps even in the case of n = 2.
Authors and Affiliations
V. V. Starkov
Sharp estimates of products of inner radii of non-overlapping domains in the complex plane
In the paper we study a generalization of the extremal problem of geometric theory of functions of a complex variable on non-overlapping domains with free poles: Fix any γ ∈ R + and find the maximum (and describe all ext...
ЛИНЕЙНО-ИНВАРИАНТНЫЕ СЕМЕЙСТВА ГОЛОМОРФНЫХ ОТОБРАЖЕНИЙ ШАРА, ПЕРЕХОД К ВЫСШИМ РАЗМЕРНОСТЯМ
In the paper there has been given the complete proof of an extension theorem from [1], which concerns the changes of the order of linearly invariant families (LIF) during passage from arbitrarily fixed LIF in C^n to a LI...
ON CHARACTERIZATIONS OF MAIN PARTS OF SOME MEROMORPHIC CLASSES OF AREA NEVANLINNA TYPE IN THE UNIT DISK
We characterize main parts of Loran expansions of certain meromorphic spaces in the unit disk defined with the help of Nevanlinna characteristic.
СВОЙСТВО ВЫПУКЛОСТИ ВЗАИМНЫХ МУЛЬТИФРАКТАЛЬНЫХ РАЗМЕРНОСТЕЙ
В работе установлено свойство выпуклости взаимной муль- тифрактальной упаковочной размерности подмножества пере- сечения носителей вероятностых борелевских мер µ и ν. Также показано, что взаимная мультифрактальная хаусдо...
ОБ ОДНОМ СВОЙСТВЕ ЗАДАЧИ ЛИНЕЙНОГО ПРОГРАММИРОВАНИЯ С ПСЕВДОИНТЕРВАЛЬНЫМИ ПЕРЕМЕННЫМИ
The optimization task with linear constraints of pseudo-interval variables is discussed in the article. It is proofed that if the task has optimal solution, then there is a solution that has not more than M non-zero vari...