SearcharxivSearch

arXiv · 2607.27226

Polynomial Maps with Constants over Division Algebras and the Generalized Kaplansky--L'vov Conjecture

Abstract

The Kaplansky--L'vov conjecture asserts that the image of a multilinear polynomial map on a full matrix algebra over a field is always a vector space. Although the conjecture remains open in general, substantial progress has been made for $2\times 2$ and $3\times 3$ matrix algebras over various fields. Recently, Panja, Saini, and Singh formulated a generalized Kaplansky--L'vov conjecture for polynomial maps with matrix coefficients over algebraically closed fields and verified it for $2\times 2$ matrices. In this work, we investigate an analogous problem for polynomial maps with constant matrix coefficients over an infinite division algebra. Specifically, we consider polynomials in the free algebra $M_2(\mathbb D)\langle x_1,\ldots,x_m\rangle$ of the form $\omega = A_1x_1^{k_1}+\cdots+A_mx_m^{k_m},$ where the $A_1,\ldots, A_m\in M_2(\mathbb D)$ are fixed matrices, $\mathbb D$ is an infinite division algebra, and $k_1,\ldots, k_m$ are positive integers. We prove that the corresponding generalized Kaplansky--L'vov conjecture holds for $2\times 2$ matrices over $\mathbb R$ and the quaternion division algebra $\mathbb H$. We also investigate the surjectivity of these polynomial maps. This can be viewed as a generalized Waring problem for matrix algebras.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Archit Gangwal, Arunava Mandal, Somesh Verma. 2026-07-10. Polynomial Maps with Constants over Division Algebras and the Generalized Kaplansky--L'vov Conjecture. https://arxiv.org/abs/2607.27226

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

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA