SearcharxivSearch

arXiv · 2305.19731

Surjectivity of polynomial maps on Matrices

Abstract

For $n\geq 2$, we consider the map on $M_n(\mathbb K)$ given by evaluation of a polynomial $f(X_1, \ldots, X_m)$ over the field $\mathbb K$. In this article, we explore the image of the diagonal map given by $f=\delta_1 X_1^{k_1} + \delta_2 X_2^{k_2} + \cdots +\delta_m X_m^{k_m}$ in terms of the solution of certain equations over $\mathbb K$. In particular, we show that for $m\geq 2$, the diagonal map is surjective when (a) $\mathbb K= \mathbb C$, (b) $\mathbb K= \mathbb F_q$ for large enough $q$. Moreover, when $\mathbb K= \mathbb R$ and $m=2$ it is surjective except when $n$ is odd, $k_1, k_2$ are both even, and $\delta _1\delta_2>0$ (in that case the image misses negative scalars), and the map is surjective for $m\geq 3$. We further show that on $M_n(\mathbb H)$ the diagonal map is surjective for $m\geq 2$, where $\mathbb H$ is the algebra of Hamiltonian quaternions.

Explore related subjects

Keep this discovery

BibTeXRIS

Saikat Panja, Prachi Saini, Anupam Singh. 2023-05-31. Surjectivity of polynomial maps on Matrices. https://arxiv.org/abs/2305.19731

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR