Related papers: On the invariance of super-linearization under pol…

We study the structure of length four polynomial automorphisms of $R[X,Y]$ when $R$ is a UFD. The results from this study are used to prove that if $\text{SL}_m(R[X_1,X_2,..., X_n]) = \text{E}_m(R[X_1,X_2,..., X_n])$ for all $n, m \ge 0$…

We provide significant conditions under which we prove the existence of stable open book structures at infinity, i.e. on spheres $S^{m-1}_R$ of large enough radius $R$. We obtain new classes of real polynomial maps $\mathbb R^m \to \mathbb…

It is known that automorphisms of quasi-circular domains fixing the origin are polynomial mappings. By introducing the so-called resonance order and quasi-resonance order, we provide a uniform upper bound for the degree of such polynomial…

The invariant classification of superintegrable systems is reviewed and utilized to construct singular limits between the systems. It is shown, by construction, that all superintegrable systems on conformally flat, 3D complex Riemannian…

We prove that every monomorphism of the Lie algebra $\ggu_n$ of unitriangular derivations of the polynomial algebra $P_n=K[x_1,..., x_n]$ is an automorphism.

The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…

We prove that the group of automorphisms of the Lie algebra $\Der_K (P_n)$ of derivations of a polynomial algebra $P_n=K[x_1,..., x_n]$ over a field of characteristic zero is canonically isomorphic to the the group of automorphisms of the…

A well known method to solve the Polynomial Eigenvalue Problem (PEP) is via linearization. That is, transforming the PEP into a generalized linear eigenvalue problem with the same spectral information and solving such linear problem with…

We discuss how the presence of a suitable symmetry can guarantee the perturbative linearizability of a dynamical system - or a parameter dependent family - via the Poincar\'e Normal Form approach. We discuss this at first formally, and…

We consider linear systems on toric varieties of any dimension, with invariant base points, giving a characterization of special linear systems. We then make a new conjecture for linear systems on rational surfaces.

In this short note, we give a new sufficient condition for a linear map from a product of copies of a field to endomorphisms of a finite dimensional vector space over the same field to be an algebra homomorphism. We expect that this result…

If an outer (multilinear) commutator identity holds in a large subgroup of a group, then it holds also in a large characteristic subgroup. Similar assertions are valid for algebras and their ideals or subspaces. Varying the meaning of the…

We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear…

Let $I$ be the ideal of relations between the leading terms of the polynomials defining an automorphism of $K^n$. In this paper, we prove the existence of a locally nilpotent derivation which preserves $I$. Moreover, if $I$ is principal,…

It is well-known that the controllability of finite-dimensional nonlinear systems can be established by showing the controllability of the linearized system. However, this classical result does not generalize to infinite-dimensional…

This paper derives two stabilizability theorems for a basic class of discrete-time nonlinear systems with multiple unknown parameters. First, we claim that a discrete-time multi-parameter system is stabilizable if its nonlinear growth rate…

Let $K$ be a field, and let $\Aut \,K^2$ be the group of polynomial automorphisms of $K^2$. We investigate which subgroups are linear or not. In characteristic zero, there are small nonlinear subgroups and some big linear subgroups. When…

A recently-established necessary condition for polynomials that preserve the class of entrywise nonnegative matrices of a fixed order is shown to be necessary and sufficient for the class of nonnegative monomial matrices. Along the way, we…

The reliability polynomial of a graph gives the probability that a graph remains operational when all its edges could fail independently with a certain fixed probability. In general, the problem of finding uniformly most reliable graphs…

Let K be an algebraically closed field of characteristic zero. We say that a polynomial automorphism f : K^n -> K^n is special if the Jacobian of f is equal to 1. We show that every (n - 1)-dimensional component H of the set Fix(f) of fixed…