Related papers: On cubic-linear polynomial mappings

For a two-parameter family of lower triangular matrices with entries involving Jacobi polynomials an explicit inverse is given, with entries involving a sum of two Jacobi polynomials. The formula simplifies in the Gegenbauer case and then…

The problem of finding a canonical form of complex matrices up to conjugacy with the set of canonical matrices being a union of affine planes in the matrix space is considered. A solution of the problem is given producing a new canonical…

The Jacobian conjecture in dimension $n$ asserts that any polynomial endomorphism of $n$-dimensional affine space over a field of zero characteristic, with the Jacobian equal 1, is invertible. The Dixmier conjecture in rank $n$ asserts that…

We propose a simple new combinatorial model to study spaces of acyclic Jacobi diagrams, in which they are identified with algebras of words modulo operations. This provides a starting point for a word-problem type combinatorial…

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…

An element of a group is \emph{reversible} if it is conjugate to its own inverse, and it is \emph{strongly reversible} if it is conjugate to its inverse by an involution. A group element is strongly reversible if and only if it can be…

Given a permutation polynomial of a large finite field, finding its inverse is usually a hard problem. Based on a piecewise interpolation formula, we construct the inverses of cyclotomic mapping permutation polynomials of arbitrary finite…

This paper is a sequel of arXiv:2109.06394. In this paper, we consider a kind of inverse problem of multipliers. The problem is to count number of isospectral correspondences, correspondences which has the same combination of multipliers.…

The Jacobian conjecture involves the map $y= x - V(x)$ where $y, x$ are n-dimensional vectors, $V(x)$ is a symmetric polynomial of degree $d$ for which the Jacobian hypothesis holds: $ e^{Tr \ln(1- V'(x))} =1,\ \forall x$. The conjecture…

In the recent progress [BE1], [M], [Z1] and [Z2], the well-known Jacobian conjecture ([BCW], [E]) has been reduced to a problem on HN (Hessian nilpotent) polynomials (the polynomials whose Hessian matrix are nilpotent) and their (deformed)…

Using the dbar-problem and dual dbar-problem, we derive bilinear relations which allows us to construct integrable hierarchies in different parametrizations, their Darboux-B\"{a}cklund transformations and to analyze constraints for them ina…

We introduce and study the notion of contact dual pair adopting a line bundle approach to contact and Jacobi geometry. A contact dual pair is a pair of Jacobi morphisms defined on the same contact manifold and satisfying a certain…

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…

We prove that all injective maps on positive complex matrices which preserve order and shrink spectrum are implemented by unitary or antiunitary conjugations. We show by counterexamples that all assumptions are indispensable. The result…

We give a simple direct proof of the Jamiolkowski criterion to check whether a linear map between matrix algebras is completely positive or not. This proof is more accesible for physicists than others found in the literature and provides a…

We present a method to decompose a set of multivariate real polynomials into linear combinations of univariate polynomials in linear forms of the input variables. The method proceeds by collecting the first-order information of the…

Let $(P, Q)$ be a pair of Jacobian polynomials. We can show that $ <P, Q>+l+2g(P)-2= 0= <P, [P,Q]>$, where $<f, g>$ is the intersection number of $f, g\in \CC[x, y]$ in the affine plane, $l$ is the number of branch at point at infinity and…

In the paper, we first classify all polynomial maps of the form $H=(u(x,y,z),v(x,y,z), h(x,y))$ in the case that $JH$ is nilpotent and $\deg_zv\leq 1$. After that, we generalize the structure of $H$ to…

A polynomial transformation of the real plane $\Bbb R^2$ is a mapping $\Bbb R^2\to\Bbb R^2$ given by two polynomials of two variables. Such a transformation is called quadratic if the degrees of its polynomials are not greater than two. In…

The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…