Related papers: Graded matrix factorizations of size two and reduc…

Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families…

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 propose a novel factorization of a non-singular matrix $P$, viewed as a $2\times 2$-blocked matrix. The factorization decomposes $P$ into a product of three matrices that are lower block-unitriangular, upper block-triangular, and lower…

Matrix Factorization has emerged as a widely adopted framework for modeling data exhibiting low-rank structures. To address challenges in manifold learning, this paper presents a subspace-constrained quadratic matrix factorization model.…

We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and…

Expanding on the comprehensive factorization of functors internal to a category C, under fairly mild conditions on a monad T on C we establish that this orthogonal factorization system exists even in Burroni's category Cat(T) of (internal)…

We provide a complete classification of the singularities of cluster algebras of finite cluster type. This extends our previous work about the case of trivial coefficients. Additionally, we classify the singularities of cluster algebras for…

We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive…

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…

We discuss and provide nontrivial evidence for a large class of dualities in three-dimensional field theories with different gauge groups. We match the full partition functions of the dual phases for any value of the couplings to underpin…

In this paper we revisit the $S^1$ reduction of 4d $\mathcal{N}=1$ gauge theories, considering a double scaling on the radius of the circle and on the real masses arising from the global symmetries in the compactification. We discuss the…

For an in invertible quasihomogeneous singularity $w$ we prove an all-genus mirror theorem establishing an isomorphism between two cohomological field theories. On the $B$-side it is the Saito-Givental theory given by a certain choice of a…

In this paper, we study factorizations of cycles. The main result is that under certain condition, the number of ways to factor a $d$-cycle into a product of cycles of prescribed lengths is $d^{r-2}.$ To prove our result, we first define a…

Square matrices appear in many machine learning problems and models. Optimization over a large square matrix is expensive in memory and in time. Therefore an economic approximation is needed. Conventional approximation approaches factorize…

This paper is concentrated on the classification of permutation matrix with the permutation similarity relation, mainly about the canonical form of a permutational similar equivalence class, the cycle matrix decomposition of a permutation…

Two doubly indexed families of polynomials in several indeterminates are considered. They are related to the falling and rising factorials in a similar way as the potential polynomials (introduced by L. Comtet) are related to the ordinary…

We consider matrix factorizations and homological mirror symmetry on the torus T^2 using a Landau-Ginzburg description. We identify the basic matrix factorizations of the Landau-Ginzburg superpotential and compute the full spectrum, taking…

Associated to a graph $G$ is a set $\mathcal{S}(G)$ of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be…

This paper explores a factorization using bidiagonal matrices of the recurrence matrix of Hahn multiple orthogonal polynomials. The factorization is expressed in terms of ratios involving the generalized hypergeometric function ${}_3F_2$…

Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms for factoring such polynomials and related tasks (such as…