Instances of the Kaplansky-Lvov multilinear conjecture for polynomials of degree three

Given a positive integer d, the Kaplansky-Lvov conjecture states that the set of values of a multilinear noncommutative polynomial f on the matrix algebra M_d(C) is a vector subspace. In this article the technique of using one-wiggle families of Sylvester's clock-and-shift matrices is championed to establish the conjecture for polynomials f of degree three when d is even or d<17.Comment: v3: 17 pages (minor changes); supplementary material (a Mathematica notebook) is available from Other formats or can be found at http://www.math.auckland.ac.nz/~igorklep/publ.htm

Nuclear structure calculations for neutron-star crusts

The goal of this paper is to investigate properties of clusterized nuclear matter which is believed to be present in crusts of neutron stars at subnuclear densities. It is assumed that the whole system can be represented by the set of Wigner-Seitz cells, each containing a nucleus and an electron background under the condition of electroneutrality. The nuclear structure calculations are performed within the relativistic mean-field model with the NL3 parametrization. The first set of calculations is performed assuming the constant electron background. The evolution of neutron and proton density distributions was systematically studied along isotopic chains until very neutron-rich system beyond the neutron dripline. Then we have replaced the uniform electron background with the realistic electron distributions, obtained within the Thomas-Fermi approximation in a self-consistent way with the proton distributions. Finally, we have investigated the evolution of the $\beta$-stability valley as well as neutron and proton driplines with the electron density.Comment: 21 pages, 14 figure

Semidefinite programming in matrix unknowns which are dimension free

One of the main applications of semidefinite programming lies in linear systems and control theory. Many problems in this subject, certainly the textbook classics, have matrices as variables, and the formulas naturally contain non-commutative polynomials in matrices. These polynomials depend only on the system layout and do not change with the size of the matrices involved, hence such problems are called "dimension-free". Analyzing dimension-free problems has led to the development recently of a non-commutative (nc) real algebraic geometry (RAG) which, when combined with convexity, produces dimension-free Semidefinite Programming. This article surveys what is known about convexity in the non-commutative setting and nc SDP and includes a brief survey of nc RAG. Typically, the qualitative properties of the non-commutative case are much cleaner than those of their scalar counterparts - variables in R^g. Indeed we describe how relaxation of scalar variables by matrix variables in several natural situations results in a beautiful structure.Comment: 25 pages; surve