Related papers: Factoring Pseudoidentity Matrix Pairs
We present algorithms to factorize weighted homogeneous elements in the first polynomial Weyl algebra and $q$-Weyl algebra, which are both viewed as a $\mathbb{Z}$-graded rings. We show, that factorization of homogeneous polynomials can be…
For every imprimitive complex reflection group of rank 2, we construct a semi-orthogonal decomposition of the derived category of the associated global quotient stack which categorifies the usual decomposition of the orbifold cohomology…
Matrix factorization is a simple and effective solution to the recommendation problem. It has been extensively employed in the industry and has attracted much attention from the academia. However, it is unclear what the low-dimensional…
Buchweitz-Greuel-Schreyer conjectured in 1987 a lower bound on the ranks of matrix factorizations over certain local hypersurface rings. We study a graded version of this conjecture, and we show that it implies a novel conjecture concerning…
We prove a conjecture of Shklyarov concerning the relationship between K. Saito's higher residue pairing and a certain pairing on the periodic cyclic homology of matrix factorization categories. Along the way, we give new proofs of a result…
We prove two identities of Hall-Littlewood polynomials, which appeared recently in a paper by two of the authors. We also conjecture, and in some cases prove, new identities which relate infinite sums of symmetric polynomials and partition…
Factorization of matrices of Laurent polynomials plays an important role in mathematics and engineering such as wavelet frame construction and filter bank design. Wavelet frames (a.k.a. framelets) are useful in applications such as signal…
Matrix factorization models have been extensively studied as a valuable test-bed for understanding the implicit biases of overparameterized models. Although both low nuclear norm and low rank regularization have been studied for these…
Ferroni and Larson gave a combinatorial interpretation of the braid Kazhdan-Lusztig polynomials in terms of series-parallel matroids. As a consequence, they confirmed an explicit formula for the leading Kazhdan-Lusztig coefficients of braid…
Gradient descent for matrix factorization exhibits an implicit bias toward approximately low-rank solutions. While existing theories often assume the boundedness of iterates, empirically the bias persists even with unbounded sequences. This…
Let $A$ be a matrix with nonnegative real entries. A nonnegative factorization of size $k$ is a representation of $A$ as a sum of $k$ nonnegative rank-one matrices. The space of all such factorizations is a bounded semialgebraic set, and we…
We define a notion of pseudo-unitarizability for weight modules over a generalized Weyl algebra (of rank one, with commutative coeffiecient ring $R$), which is assumed to carry an involution of the form $X^*=Y$, $R^*\subseteq R$. We prove…
We give a complete factorization of the invariant factors of resultant matrices built from birational parameterizations of rational plane curves in terms of the singular points of the curve and their multiplicity graph. This allows us to…
We present a novel recursive algorithm for reducing a symmetric matrix to a triangular factorization which reveals the rank profile matrix. That is, the algorithm computes a factorization $\mathbf{P}^T\mathbf{A}\mathbf{P} =…
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…
In a recent paper, Ayyer and Behrend present for a wide class of partitions factorizations of Schur polynomials with an even number of variables where half of the variables are the reciprocals of the others into symplectic and/or orthogonal…
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…
We prove a generalization of Orlov's theorem for matrix factorizations with $n$ steps. Let $X$ be a regular scheme, $W\colon X\to \mathbb{A}^1$ a flat morphism and $D:=W^{-1}(0)$ its central fiber. We construct an appropriate triangulated…
Many applications in scientific computing and data science require the computation of a rank-revealing factorization of a large matrix. In many of these instances the classical algorithms for computing the singular value decomposition are…
The Kazhdan-Lusztig polynomials for finite Weyl groups arise in the geometry of Schubert varieties and representation theory. It was proved very soon after their introduction that they have nonnegative integer coefficients, but no…