English
Related papers

Related papers: A sharp degree bound in the real Jacobian conjectu…

200 papers

An injective $k$-edge-coloring of a graph $G$ is a mapping $\phi$: $E(G)\rightarrow\{1,2,...,k\}$, such that $\phi(e)\ne\phi(e')$ if edges $e$ and $e'$ are at distance two, or are in a triangle. The smallest integer $k$ such that $G$ has an…

Combinatorics · Mathematics 2025-09-12 Danjun Huang , Yuqian Guo

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

Commutative Algebra · Mathematics 2016-01-05 Elzbieta Adamus , Pawel Bogdan , Teresa Crespo , Zbigniew Hajto

The study of proper rational mappings between balls in complex Euclidean spaces naturally leads to the relationship between the degree and imbedding dimension of such a mapping. The special case for monomial mappings is equivalent to the…

Complex Variables · Mathematics 2008-01-16 John P. D'Angelo , Jiri Lebl , Han Peters

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…

Commutative Algebra · Mathematics 2016-02-04 Vered Moskowicz

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…

Commutative Algebra · Mathematics 2015-07-13 Stefan Maubach , Abdul Rauf

The Jacobian Conjecture states that any locally invertible polynomial system in C^n is globally invertible with polynomial inverse. C. W. Bass et al. (1982) proved a reduction theorem stating that the conjecture is true for any degree of…

Algebraic Geometry · Mathematics 2018-06-22 A. de Goursac , A. Sportiello , A. Tanasa

The famous Jacobian Conjecture asks if a morphism $f:K[x,y]\to K[x,y]$ with invertible Jacobian, is invertible ($K$ is a characteristic zero field). A known result says that if $K[f(x),f(y)] \subseteq K[x,y]$ is an integral extension, then…

Commutative Algebra · Mathematics 2015-06-18 Vered Moskowicz

Existence of superdecomposable pure-injective modules reflects complexity in the category of finite-dimensional representations over an algebra. Such an existence occurs when an algebra is non-domestic; a conjecture due to M. Prest. G.…

Representation Theory · Mathematics 2026-03-05 Shantanu Sardar

Fessler and Gutierrez \cite{Fe,Gu} proved that if a non-singular planar map has Jacobian matrix without eigenvalues in $(0,+\infty)$, then it is injective. We prove that the same holds replacing $(0,+\infty)$ with any unbounded curve…

Classical Analysis and ODEs · Mathematics 2022-02-14 Marco Sabatini

Let $R$ be an affine domain of characteristic zero with finite quotients. We prove that a polynomial map over $R$ is surjective if and only if it is surjective over $\hat{R_{\mathfrak{m}}}$, the completion of $R$ with respect to…

Commutative Algebra · Mathematics 2019-09-27 Lukas Prader

One of the aims of this article is to provide a class of polynomial mappings for which the Jacobian conjecture is true. Also, we state and prove several global univalence theorems and present a couple of applications of them.

Complex Variables · Mathematics 2017-06-01 Saminathan Ponnusamy , Victor V. Starkov

It is shown that the $n$-dimensional Jacobian conjecture over algebraic number fields may be considered as an existence problem of integral points on affine curves. More specially, if the Jacobian conjecture over $\mathbb{C}$ is false, then…

Algebraic Geometry · Mathematics 2020-11-20 Nguyen Van Chau

We present an algorithmic equivalent statement to the Jacobian conjecture. Given a polynomial map F on an affine space of dimension n, our algorithm constructs n sequences of polynomials such that F is invertible if and only if the zero…

Commutative Algebra · Mathematics 2015-06-05 Elzbieta Adamus , Pawel Bogdan , Teresa Crespo , Zbigniew Hajto

An injective $k$-edge-coloring of a graph $G$ is a mapping $\phi$: $E(G)\rightarrow\{1,2,...,k\}$, such that $\phi(e)\ne\phi(e')$ if edges $e$ and $e'$ are at distance two, or are in a triangle. The smallest integer $k$ such that $G$ has an…

Combinatorics · Mathematics 2025-09-12 Danjun Huang , Yuqian Guo

Let $f$ be a generically finite polynomial map $f: \mathbb{C}^n\to \mathbb{C}^m$ of algebraic degree $d$. Motivated by the study of the Jacobian Conjecture, we prove that the set $S_f$ of non-properness of $f$ is covered by parametric…

Algebraic Geometry · Mathematics 2019-06-12 Zbigniew Jelonek , Michał Lasoń

Let $D$ be a non-empty effective divisor on $\mathbb{P}^1$. We show that when ordered by height, any set of $(D,S)$-integral points on $\mathbb{P}^1$ of bounded degree has relative density zero. We then apply this to arithmetic dynamics:…

Number Theory · Mathematics 2016-07-29 Joseph Gunther , Wade Hindes

A non-zero constant Jacobian polynomial map $F=(P,Q):\mathbb{C}^2 \longrightarrow \mathbb{C}^2$ has a polynomial inverse if the component $P$ is a simple polynomial, i.e. if, when $P$ extended to a morphism $p:X\longrightarrow \mathbb{P}^1$…

Algebraic Geometry · Mathematics 2017-09-13 Nguyen Van Chau

An injective $k$-edge-coloring of a graph $G$ is an assignment of colors, i.e. integers in $\{1, \ldots , k\}$, to the edges of $G$ such that any two edges each incident with one distinct endpoint of a third edge, receive distinct colors.…

Data Structures and Algorithms · Computer Science 2021-04-19 Florent Foucaud , Hervé Hocquard , Dimitri Lajou

We study the injectivity radius of complete Riemannian surfaces (S,g) with curvature |K(g)| bounded by 1. We show that if S is orientable with nonabelian fundamental group, then there is a point p in S with injectivity radius at least…

Differential Geometry · Mathematics 2014-04-18 Matthieu Gendulphe

We propose the following conjecture: For every fixed $\alpha\in [0,\frac 13)$, each graph of minimum degree at least $(1+\alpha)\frac k2$ and maximum degree at least $2(1-\alpha)k$ contains each tree with $k$ edges as a subgraph. Our main…

Combinatorics · Mathematics 2020-08-13 Guido Besomi , Matías Pavez-Signé , Maya Stein