Related papers: An inversion algorithm for polynomial maps

For any integer $d \geq 1$, we verify the Jacobian Conjecture for a $d$-linear map in two variables. We prove that almost all the coefficients of the formal inverse are in the ideal specified by the Jacobian condition. We find expressions…

A polynomial endomorphism $\sigma\in {\rm End}_K(P_n)$ is called a Jacobian map if its Jacobian is a nonzero scalar (the field has zero characteristic). Each Jacobian map $\sigma$ is extended to an endomorphism $\sigma$ of the Weyl algebra…

We reprove the results of Jordan [18] and Siebert [31] and show that the Lie algebra of polynomial vector fields on an irreducible affine variety X is simple if and only if X is a smooth variety. Given proof is self-contained and does not…

We solve the problem of inversion of an extended Abel-Jacobi map $$ \int_{P_{0}}^{P_{1}}\omega +...+\int_{P_{0}}^{P_{g+n-1}}\omega ={\bf z}, \qquad \int_{P_{0}}^{P_{1}}\Omega_{j1}+... +\int_{P_{0}}^{P_{g+n-1}}\Omega_{j1} =Z_{j},\quad…

We prove the following autoduality theorem for an integral projective curve C in any characteristic. Given an invertible sheaf L of degree 1, form the corresponding Abel map A_L: C->J, which maps C into its compactified Jacobian, and form…

Let $F$ be an algebraically closed field of characteristic zero. We consider the question which subsets of $M_n(F)$ can be images of noncommutative polynomials. We prove that a noncommutative polynomial $f$ has only finitely many similarity…

Our goal is to settle the following faded problem: The Jacobian Conjecture (JC_n): If f_1,..,f_n are elements in a polynomial ring k[X_1,..,X_n] over a field k of characteristic 0 such that det(\partial f_i/ \partial X_j) is a nonzero…

Following the author's previous works, we continue to consider the problem of counting the number of affine conjugacy classes of polynomials of one complex variable when its unordered collection of holomorphic fixed point indices is given.…

We show that for two afii varieties over an arbitrary field of characteristic zero, there is no general form of an algorithm for checking the presence of an embedding of one algebraic variety in another. Moreover, we establish this for…

In this paper, we give two algorithms to compute preimages of curves under polynomial endomorphisms. In particular, this gives an efficient way of computing preimages of points. Furthermore, we explain the abstract setting under which one…

We generalise clones, which are sets of functions $f:A^n \rightarrow A$, to sets of mappings $f:A^n \rightarrow A^m$. We formalise this and develop language that we can use to speak about it. We then look at bijective mappings, which have…

Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient algorithm that decides this question and finds the…

By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…

We present a new probabilistic symbolic algorithm that, given a variety defined in an n-dimensional affine space by a generic sparse system with fixed supports, computes the Zariski closure of its projection to an l-dimensional coordinate…

The goal of this paper is to introduce a new constructive geometric proof of the affine version of Chevalley's Theorem. This proof is algorithmic and a verbatim implementation resulted in an efficient code for computing the constructible…

A hollow matrix described by a graph $G$ is a real symmetric matrix having all diagonal entries equal to zero and with the off-diagonal entries governed by the adjacencies in $G$. For a given graph $G$, the determination of all possible…

In the field of the Jacobian conjecture it is well-known after Druzkowski that from a polynomial "cubic-homogeneous" mapping we can build a higher-dimensional "cubic-linear" mapping and the other way round, so that one of them is invertible…

By suitable examples we illustrate an algorithm for composition of inverse problems.

The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…

We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor. If $G$ is bipartite then one can…