Related papers: An inversion algorithm for polynomial maps

When the plane is pie-sliced in $n\leq 4$ parts (with nonempty interior and common vertex at the origin) our main result provides a sufficient condition for any map $L$, that is continuous and piecewise linear relatively to this slicing, to…

A polynomial automorphism of $\mathbb{A}^n$ over a field of characteristic zero is called co-tame if, together with the affine subgroup, it generates the entire tame subgroup. We prove some new classes of automorphisms, including…

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

Let F = F_p for any fixed prime p >= 2. An affine-invariant property is a property of functions on F^n that is closed under taking affine transformations of the domain. We prove that all affine-invariant property having local…

The Classical Jacobian Conjecture claims that any unramified endomorphism of a complex affine space is an automorphism. In order to embed this conjecture in a geometric environment, where one could enjoy the beauty and the richness of tools…

Let $f$ be a polynomial automorphism of the affine plane. In this paper we consider the possibility for it to possess infinitely many periodic points on an algebraic curve $C$. We conjecture that this happens if and only if $f$ admits a…

The famous Jacobian conjecture asks if an endomorphism $f$ of $K[x,y]$ ($K$ is a characteristic zero field) having a non-zero scalar Jacobian is invertible. Let $\alpha$ be the exchange involution on $K[x,y]$: $\alpha(x)= y$ and $\alpha(y)=…

Jacobian conjectures (that nonsingular implies invertible) for rational everywhere defined maps of real n-space to itself are considered, with no requirement for a constant Jacobian determinant or a rational inverse. The associated…

Let $V$ be a two-dimensional vector space over a field $\mathbb F$ of characteristic not $2$ or $3$. We show there is a canonical surjection $\nu$ from the set of suitably generic commutative algebra structures on $V$ modulo the action of…

Recently Takens' Reconstruction Theorem was studied in the complex analytic setting by Forn{\ae}ss and Peters \cite{FP}. They studied the real orbits of complex polynomials, and proved that for non-exceptional polynomials ergodic properties…

This paper focuses on the equidimensional decomposition of affine varieties defined by sparse polynomial systems. For generic systems with fixed supports, we give combinatorial conditions for the existence of positive dimensional components…

Consider a quadratic polynomial $f\left(\xi_{1},\dots,\xi_{n}\right)$ of independent Bernoulli random variables. What can be said about the concentration of $f$ on any single value? This generalises the classical Littlewood--Offord problem,…

Let $p$ be a multilinear polynomial in several non-commuting variables with coefficients in a quadratically closed field $K$ of any characteristic. It has been conjectured that for any $n$, the image of $p$ evaluated on the set $M_n(K)$ of…

In this paper, we study the nonlinear inverse problem of estimating the spectrum of a system matrix, that drives a finite-dimensional affine dynamical system, from partial observations of a single trajectory data. In the noiseless case, we…

The main theorem (2.2) consists in two characterizations of isomorphisms of factorial domains in terms of prime or primary rings elements, and unramified, flat or weakly injective affine schemes morphisms. In order to apply this theorem to…

This paper shows that orbital equations generated by iteration of polynomial maps do not have necessarily a unique representation. Remarkably, they may be represented in an infinity of ways, all interconnected by certain nonlinear…

The polynomial automorphisms of the affine plane over a field K form a group which has the structure of an amalgamated free product. This well-known algebraic structure can be used to determine some key results about the symmetry and…

We consider the function $x^{-1}$ that inverses a finite field element $x \in \mathbb{F}_{p^n}$ ($p$ is prime, $0^{-1} = 0$) and affine $\mathbb{F}_{p}$-subspaces of $\mathbb{F}_{p^n}$ such that their images are affine subspaces as well. It…

The use of permutation polynomials has appeared, along to their compositional inverses, as a good choice in the implementation of cryptographic systems. Hence, there has been a demand for constructions of these polynomials which…

We claimed that there is a polynomial algorithm to test if two graphs are isomorphic. But the algorithm is wrong. It only tests if the adjacency matrices of two graphs have the same eigenvalues. There is a counterexample of two…