English

On 3-matrix factorizations of polynomials

Category Theory 2024-02-05 v1

Abstract

Let R=K[x1,x2,,xm]R=K[x_{1},x_{2},\cdots, x_{m}] and S=S= K[y1,y2,,ym]K[y_{1},y_{2},\cdots, y_{m}] where KK is a field. %commutative ring with unity. In this paper, we propose a method showing how to obtain 33-matrix factors for a given polynomial using either the Doolittle or the Crout decomposition techniques that we apply to matrices whose entries are not real numbers but polynomials. We also define the category of 33-matrix factorizations of a polynomial ff whose objects are 33-matrix factorizations of ff, that is triplets (P,Q,T)(P,Q,T) of m×mm\times m matrices such that PQT=fImPQT=fI_{m}. Moreover, we construct a bifunctorial operation ˉ3\bar{\otimes}_{3} which is such that if XX (respectively YY) is a 33-matrix factorization of fRf\in R (respectively gSg\in S), then Xˉ3YX\bar{\otimes}_{3} Y is a 33-matrix factorization of fgK[x1,x2,,xm,y1,y2,,ym]fg\in K[x_{1},x_{2},\cdots, x_{m},y_{1},y_{2},\cdots, y_{m}]. We call ˉ3\bar{\otimes}_{3} the multiplicative tensor product of 33-matrix factorizations. Finally, we give some properties of the operation ˉ3\bar{\otimes}_{3}.

Keywords

Cite

@article{arxiv.2402.00991,
  title  = {On 3-matrix factorizations of polynomials},
  author = {Yves Baudelaire Fomatati},
  journal= {arXiv preprint arXiv:2402.00991},
  year   = {2024}
}

Comments

13 pages. arXiv admin note: text overlap with arXiv:2208.02476, arXiv:2310.03372, arXiv:2105.10811

R2 v1 2026-06-28T14:35:12.795Z