{
  "annotation_id": "a639a2e7-6da9-4ace-81d6-6fb70bb7345c",
  "date_created": "2026-02-17T05:53:12.445000Z",
  "date_modified": "2026-02-17T05:53:12.445000Z",
  "file_hash": "ced2f0894f8c65c66e0c660bc2a54f2e6eac819f11efd559593bdbd05c689bf4",
  "private": false,
  "record": {
    "abstract": "Formanek made the conjecture that the minimal degree of the central polynomials for the $n\\times n$ matrix algebra over a field of characteristic 0 is $(n^2+3n-2)/2$ and this is true for $n\\leq 3$. For $n=4$ there are examples of central polynomials of degree $13=(4^2+3\\cdot 4-2)/2$ and we do not know whether there are central polynomials of lower degree. In this paper we discuss methods for searching for central polynomials of low degree and prove that the algebra of $4\\times 4$ matrices does not have central polynomials in two variables of degree $\\leq 12$. As a byproduct of our computations we obtain that this algebra does not have also polynomial identities in two variables of degree $\\leq 12$.",
    "arxiv_id": "2601.07750",
    "authors": [
      "Vesselin Drensky",
      "Boyan Kostadinov"
    ],
    "categories": [
      "math.RA"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "title": "Central polynomials of minimal degree for matrices",
    "url": "https://arxiv.org/abs/2601.07750",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7f3a9ee3-9089-4e60-8c69-76f088ec29e8",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}