Related papers: Matrix Factorizations via the Inverse Function The…

We consider LU and QR matrix decompositions using exact computations. We show that fraction-free Gauss--Bareiss reduction leads to triangular matrices having a non-trivial number of common row factors. We identify two types of common…

We consider the analytic continuation of the transfer function associated with a 2x2 operator matrix having unbounded couplings into unphysical sheets of its Riemann surface. We construct a family of non-selfadjoint operators which…

The Implicit and Inverse Function Theorems are special cases of a general Implicit/Inverse Function Theorem which can be easily derived from either theorem. The theorems can thus be easily deduced from each other via the generalized…

We give an overview of the existing algorithms to compute nonunique factorization invariants in finitely generated monoids.

This article gives matrix factorizations for the trivalent diagrams and double line appearing in $\mathfrak{sl}_n$ quantum link invariant. These matrix factorizations reconstruct Khovanov-Rozansky homology. And we show that the Euler…

Several physics-based algorithms for factorizing large number were recently published. A notable recent one by Schleich et al. uses Gauss sums for distinguishing between factors and non-factors. We demonstrate two NMR techniques that…

We discuss an interesting duality known to occur for certain complex reflection groups, namely the duality groups. Our main construction yields a concrete, representation theoretic realisation of this duality. This allows us to naturally…

This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…

The recent two proofs for the (weak) factorization theorem for birational maps, one by W{\l}odarczyk and the other by Abramovich-Karu-Matsuki-W{\l}odarczyk rely on the results of Morelli. The former uses the process for…

A cross matrix $X$ can have nonzero elements located only on the main diagonal and the anti-diagonal, so that the sparsity pattern has the shape of a cross. It is shown that $X$ can be factorized into products of matrices that are at most…

We propose a new inertia-revealing factorization for sparse symmetric matrices. The factorization scheme and the method for extracting the inertia from it were proposed in the 1960s for dense, banded, or tridiagonal matrices, but they have…

Non-negative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. We interpret the factorization in a new way and use it to generate missing attributes from test data. We provide a joint…

A square, upper-triangular matrix U is a Cholesky root of a matrix M provided U*U=M, where * represents the conjugate transpose. Over finite fields, as well as over the reals, it suffices for U^TU=M. In this paper, we investigate the number…

We continue investigating the superintegrability property of matrix models, i.e. factorization of the matrix model averages of characters. This paper focuses on the Gaussian Hermitian example, where the role of characters is played by the…

This work is about rounding error analysis of randomized CholeskyQR-type algorithms for sparse matrices. We often encounter QR factorization of the sparse matrices in many real problems. In this work, we focus on some typical…

Motivated by constraints on the dark energy equation of state from supernova-data, we propose a formalism for the Bayesian inference of functions: Starting at a functional variant of the Kullback-Leibler divergence we construct a functional…

We study categories of matrix factorizations. These categories are defined for any regular function on a suitable regular scheme. Our paper has two parts. In the first part we develop the foundations; for example we discuss derived direct…

We give an overview of the current status of perturbative QCD factorization theorems in processes that involve transverse momentum dependent (TMD) parton distribution functions (PDFs) and fragmentation functions (FF). We enumerate those…

Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…

We prove a no-go theorem on the factorization of the lower triangular part in the Gaussian decomposition of the Yangian's universal $R$-matrix, yielding a negative answer to a conjecture of Khoroshkin and Tolstoy from [Lett. Math. Phys.…