PreprintarXiv licencearXiv
Factorization of central polynomials over division algebras
Abstract
The factorization problem is a classical topic in the theory of polynomial rings. In this paper, we obtain an irreducibility criterion for central polynomials over division algebras. An example demonstrating the computation of factors for a central polynomial is also presented.
Related
- Uniqueness of twisted linear periods over Archimedean division algebras
- Weak central polynomials for algebras of multiplications of simple algebras
- Non-commutative frieze patterns over quaternion algebras and other normed division rings
- Kubo-Ando Means of Finite Order over Real Division Algebras
- Group gradings, graded identities and central polynomials of algebras with almost polynomial δ-growth
BibTeX
@misc{goutor2026factorization,
title = {{Factorization of central polynomials over division algebras}},
author = {A. G. Goutor and S. V. Tikhonov},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.04529},
eprint = {2609.04529},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.04529},
}
RIS
TY - UNPB
TI - Factorization of central polynomials over division algebras
AU - A. G. Goutor
AU - S. V. Tikhonov
PY - 2026
DA - 2026/09/03
PB - arXiv
DO - 10.48550/arxiv.2609.04529
UR - https://arxiv.org/abs/2609.04529
AB - The factorization problem is a classical topic in the theory of polynomial rings. In this paper, we obtain an irreducibility criterion for central polynomials over division algebras. An example demonstrating the computation of factors for a central polynomial is also presented.
ER -