Related papers: Factoring Pseudoidentity Matrix Pairs
We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…
This paper is concerned with the factorization form of the rank regularized loss minimization problem. To cater for the scenario in which only a coarse estimation is available for the rank of the true matrix, an $\ell_{2,0}$-norm…
We provide a new perspective on the Kapustin-Li formula for the duality pairing on the morphism complexes in the matrix factorization category of an isolated hypersurface singularity. In our context, the formula arises as an explicit…
We fully describe the general form of a linear (or conjugate-linear) rank metric isometry on the Murray--von Neumann algebra associated with a II$_1$-factor. As an application, we establish Frobenius' theorem in the setting of…
This paper addresses two questions: (a) can we identify a sensible class of 2-parameter persistence modules on which the rank invariant is complete? (b) can we determine efficiently whether a given 2-parameter persistence module belongs to…
We show that compactly supported wavelets in L^2(R) of scale N may be effectively parameterized with a finite set of spin vectors in C^N, and conversely that every set of spin vectors corresponds to a wavelet. The characterization is given…
We study the matrix factorization problem associated with an SO(2) spinning top by using the algebro-geometric approach. We derive the explicit expressions in terms of Riemann theta functions and discus some related problems including a…
In this paper, we consider a general discrete-time spectral factorization problem for rational matrix-valued functions. We build on a recent result establishing existence of a spectral factor whose zeroes and poles lie in any pair of…
Using factorization homology techniques, we give a simple proof of the action of Kontsevich and Soibelman operad on the pair consisting of Hochschild cohomology and Hochschild homology. The proof obviously extends to higher Hochschild…
Reynolds' theory of relational parametricity formalizes parametric polymorphism for System F, thus capturing the idea that polymorphically typed System F programs always map related inputs to related results. This paper shows that Reynolds'…
Let $D$ be the ring of integers of a quadratic number field $\mathbb{Q}[\sqrt{d}]$. We study the factorizations of $2 \times 2$ matrices over $D$ into idempotent factors. When $d < 0$ there exist singular matrices that do not admit…
Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…
We introduce a Generalized Randomized QR-decomposition that may be applied to arbitrary products of matrices and their inverses, without needing to explicitly compute the products or inverses. This factorization is a critical part of a…
Yui and Zagier made some fascinating conjectures on the factorization on the norm of the difference of Weber class invariants $ f(\mathfrak a_1) - f(\mathfrak a_2)$ based on their calculation in \cite{YZ}. Here $\mathfrak a_i$ belong two…
One relates factorization of bivariate polynomials to singularities of projective plane curves. One proves that adjoint polynomials permit to solve the recombinations of the modular factors induced by the absolute and rational…
It is known that Lagrangian torus fibers of the moment map of a toric Fano manifold $X$, equipped with flat $U(1)$-connections, are mirror to matrix factorizations of the mirror superpotential $W:\check{X}\rightarrow\bC$. Via SYZ mirror…
A new necessary and sufficient condition for the existence of minor left prime factorizations of multivariate polynomial matrices without full row rank is presented. The key idea is to establish a relationship between a matrix and its full…
In the past decade, matrix factorization has been extensively researched and has become one of the most popular techniques for personalized recommendations. Nevertheless, the dot product adopted in matrix factorization based recommender…
We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…
In previous work, the second author introduced a topology, for spaces of irreducible representations, that reduces to the classical Zariski topology over commutative rings but provides a proper refinement in various noncommutative settings.…