arXiv subjects
Publications and source records attributed to Yves Baudelaire Fomatati.
In this paper, we construct the matrix nth root of a multivariate polynomial with coefficients in a field K which possesses an nth root of unity. Moreover, we explain why this concept is interesting. Finally, we give several examples to illustrate our construction.
The bicategory of Landau-Ginzburg models denoted by LGK possesses adjoints and this helps in explaining a certain duality that exists in the setting of Landau-Ginzburg models in terms of some specified relations. The construction of LGK is reminiscent of, but more complex than, the construction of the bicategory of associative algebras and bimodules. In this paper, we review this complex but very inspiring construction in order to expose it more to pure mathematicians. In particular, we spend some time explaining the intricate construction of unit morphisms in this bicategory from a new vantage point. Besides, we briefly discuss how this bicategory could be constructed in more than one way using the variants of the Yoshino tensor product. Furthermore, without resorting to Atiyah classes, we prove that the left and right unitors in this bicategory have direct right inverses but do not have direct left inverses.
Let $R=K[x_{1},x_{2},\cdots, x_{m}]$ and $S=$ $K[y_{1},y_{2},\cdots, y_{m}]$ where $K$ is a field. %commutative ring with unity. In this paper, we propose a method showing how to obtain $3$-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 $3$-matrix factorizations of a polynomial $f$ whose objects are $3$-matrix factorizations of $f$, that is triplets $(P,Q,T)$ of $m\times m $ matrices such that $PQT=fI_{m}$. Moreover, we construct a bifunctorial operation $\bar{\otimes}_{3}$ which is such that if $X$ (respectively $Y$) is a $3-$matrix factorization of $f\in R$ (respectively $g\in S$), then $X\bar{\otimes}_{3} Y$ is a $3-$matrix factorization of $fg\in K[x_{1},x_{2},\cdots, x_{m},y_{1},y_{2},\cdots, y_{m}]$. We call $\bar{\otimes}_{3}$ the multiplicative tensor product of $3-$matrix factorizations. Finally, we give some properties of the operation $\bar{\otimes}_{3}$.
Let $K$ be a field. Let $f\in K[[x_{1},...,x_{r}]]$ and $g\in K[[y_{1},...,y_{s}]]$ be nonzero elements. If $X$ (resp. $Y$) is a matrix factorization of $f$ (resp. $g$), Yoshino had constructed a tensor product (of matrix factorizations) $\hat{\otimes}$ such that $X\hat{\otimes}Y$ is a matrix factorization of $f+g\in K[[x_{1},...,x_{r},y_{1},...,y_{s}]]$. In this paper, we propose a bifunctorial operation $\widetilde{\otimes}$ and its variant $\widetilde{\otimes}'$ such that $X\widetilde{\otimes}Y$ and $X\widetilde{\otimes}' Y$ are two different matrix factorizations of $fg\in K[[x_{1},...,x_{r},y_{1},...,y_{s}]]$. We call $\widetilde{\otimes}$ the multiplicative tensor product of $X$ and $Y$. Several properties of $\widetilde{\otimes}$ are proved. Moreover, we find three functorial variants of Yoshino's tensor product $\hat{\otimes}$. Then, $\widetilde{\otimes}$ (or its variant) is used in conjunction with $\hat{\otimes}$ (or any of its variants) to give an improved version of the standard algorithm for factoring polynomials using matrices on the class of summand-reducible polynomials defined in this paper. Our algorithm produces matrix factors whose size is at most one half the size one obtains using the standard method.