Related papers: Matrix factorizations for domestic triangle singul…

Recently the first author studied multi-gradings for generalised cluster categories, these being 2-Calabi-Yau triangulated categories with a choice of cluster-tilting object. The grading on the category corresponds to a grading on the…

Variable-length codes are the bases of the free submonoids of a free monoid. There are some important longstanding open questions about the structure of finite maximal codes, namely the factorization conjecture and the triangle conjecture,…

Factorization is possible due to the universal behavior of Yang-Mills theories in soft and collinear limits. Here, we take a small step towards a more transparent understanding of these limits by proving a form of perturbative factorization…

The success of matrix factorizations such as the singular value decomposition (SVD) has motivated the search for even more factorizations. We catalog 53 matrix factorizations, most of which we believe to be new. Our systematic approach,…

We study implicit regularization when optimizing an underdetermined quadratic objective over a matrix $X$ with gradient descent on a factorization of $X$. We conjecture and provide empirical and theoretical evidence that with small enough…

Given a matroid or flag of matroids we introduce several broad classes of polynomials satisfying Deletion-Contraction identities, and study their singularities. There are three main families of polynomials captured by our approach:…

We obtain a multiplication formula for cluster characters on (stably) 2-Calabi-Yau (Frobenius or) triangulated categories. This formula generalizes those known for arbitrary pairs of objects and for Auslander-Reiten triangles. As an…

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…

In this paper, we explore the concept of the ``matrix product of graphs," initially introduced by Prasad, Sudhakara, Sujatha, and M. Vinay. This operation involves the multiplication of adjacency matrices of two graphs with assigned labels,…

For a projective variety $Z$ and for any integer $p$, define the $p$-th N\'eron-Severi group $NS_p(Z)$ of $Z$ as the image of the cycle map $A_{p}(Z)\to H_{2p}(Z; \mathbb{C})$. Now let $X\subset \Ps^{2m+1}$ ($m\geq 1$) be a projective…

This article is the continuation of [LS12]. We use categories of matrix factorizations to define a morphism of rings (= a Landau-Ginzburg motivic measure) from the (motivic) Grothendieck ring of varieties over $\mathbb{A}^1$ to the…

This paper studies the class of unique factorial domains $B$ over an algebraically closed field $k$ which are affine or unirational over $k$ and which admit an effective unmixed $\mathbb{Z}^{d-1}$-grading with $B_0=k$, where $d$ is the…

Let $S=K[x_1,...,x_n]$ or $S=K[[x_1,...,x_n]]$ be either a polynomial or a formal power series ring in a finite number of variables over a field $K$ of characteristic $p > 0$ with $[K:K^p] < \infty$. Let $R$ be the hypersurface $S/fS$ where…

Tensor factorizations are computationally hard problems, and in particular, are often significantly harder than their matrix counterparts. In case of Boolean tensor factorizations -- where the input tensor and all the factors are required…

We use a representation of a graded twisted tensor product of $K[x]$ with $K[y]$ in $L(K^{\Bbb{N}_0})$ in order to obtain a nearly complete classification of these graded twisted tensor products via infinite matrices. There is one…

The general solutions for the factorization equations of the reflection matrices $K^{\pm}(\theta)$ for the eight vertex and six vertex models (XYZ, XXZ and XXX chains) are found. The associated integrable magnetic Hamiltonians are…

For each positive integer n the HOMFLY polynomial of links specializes to a one-variable polynomial that can be recovered from the representation theory of quantum sl(n). For each such n we build a doubly-graded homology theory of links…

Euclidean distance matrices corresponding to an arithmetic progression have rich spectral and structural properties. We exploit those properties to develop completely positive factorizations of translations of those matrices. We show that…

Matroids, particularly linear ones, have been a powerful tool in parameterized complexity for algorithms and kernelization. They have sped up or replaced dynamic programming. Delta-matroids generalize matroids by encapsulating structures…

This paper provides a theoretical explanation on the clustering aspect of nonnegative matrix factorization (NMF). We prove that even without imposing orthogonality nor sparsity constraint on the basis and/or coefficient matrix, NMF still…