Refined multiplicative tensor product of matrix factorizations

From MaRDI portal
Publication:6146473

DOI10.1016/J.JPAA.2023.107556arXiv2208.02476OpenAlexW4388312456MaRDI QIDQ6146473FDOQ6146473


Authors: Yves Baudelaire Fomatati Edit this on Wikidata


Publication date: 5 February 2024

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Abstract: An algorithm for matrix factorization of polynomials was proposed in cite{fomatati2022tensor} and it was shown that this algorithm produces better results than the standard method for factoring polynomials on the class of summand-reducible polynomials. In this paper, we improve this algorithm by refining the construction of one of its two main ingredients, namely the multiplicative tensor product widetildeotimes of matrix factorizations to obtain another different bifunctorial operation that we call the reduced multiplicative tensor product of matrix factorizations denoted by overlineotimes. In fact, we observe that in the algorithm for matrix factorization of polynomials developed in cite{fomatati2022tensor}, if we replace widetildeotimes by overlineotimes, we obtain better results on the class of summand-reducible polynomials in the sense that the refined algorithm produces matrix factors which are of smaller sizes.


Full work available at URL: https://arxiv.org/abs/2208.02476




Recommendations




Cites Work






This page was built for publication: Refined multiplicative tensor product of matrix factorizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6146473)