Related papers: On factorisation systems for Ord-enriched categori…
We give a simplified algorithm of the functorial weak factorization of birational morphisms of nonsingular varieties over a field of characteristic zero into a composite of blow-ups and blow-downs with smooth centers.
We study and compare two factorisation systems for surjective homomorphisms in the category of quandles. The first one is induced by the adjunction between quandles and trivial quandles, and a precise description of the two classes of…
We prove that any right Quillen functor between arbitrary model categories admits non trivial functorial factorizations that are similar to those of a model structure. We also prove that these factorizations can be made for lax monoidal…
The work is devoted to constructing a wide class of differential-functional dynamical systems, whose rich algebraic structure makes their integrability analytically effective. In particular, there is analyzed in detail the operator Lax type…
The basic notions of category theory, such as limit, adjunction, and orthogonality, all involve assertions of the existence and uniqueness of certain arrows. Weak notions arise when one drops the uniqueness requirement and asks only for…
Nonnegative Matrix Factorization (NMF) is a widely used technique for data representation. Inspired by the expressive power of deep learning, several NMF variants equipped with deep architectures have been proposed. However, these methods…
In light of recent data science trends, new interest has fallen in alternative matrix factorizations. By this, we mean various ways of factorizing particular data matrices so that the factors have special properties and reveal insights into…
We explain how any cofibrantly generated weak factorisation system on a category may be equipped with a universally and canonically determined choice of cofibrant replacement. We then apply this to the theory of weak omega-categories,…
In a paper of 1974, Brian Day employed a notion of factorization system in the context of enriched category theory, replacing the usual diagonal lifting property with a corresponding criterion phrased in terms of hom-objects. We set forth…
We prove that the $\infty$-category of orthogonal factorization systems embeds fully faithfully into the $\infty$-category of double $\infty$-categories. Moreover, we prove an (un)straightening equivalence for double $\infty$-categories,…
In this article the notions of (quasi weakly hereditary) general closure operator $\mb{C}$ on a category $\cx$ with respect to a class $\cm$ of morphisms, and quasi factorization structures in a category $\cx$ are introduced. It is shown…
Recently, convex formulations of low-rank matrix factorization problems have received considerable attention in machine learning. However, such formulations often require solving for a matrix of the size of the data matrix, making it…
We consider the problem of learning a low-rank matrix, constrained to lie in a linear subspace, and introduce a novel factorization for modeling such matrices. A salient feature of the proposed factorization scheme is it decouples the…
Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix factorizations for…
We present new algorithms to detect and correct errors in the lower-upper factorization of a matrix, or the triangular linear system solution, over an arbitrary field. Our main algorithms do not require any additional information or…
Let G be a block matrix function with one diagonal block A being positive definite and the off diagonal blocks complex conjugates of each other. Conditions are obtained for G to be factorable (in particular, with zero partial indices) in…
Weakly orthomodular and dually weakly orthomodular lattices were introduced by the authors in a recent paper. Similarly as for orthomodular lattices we try to introduce an implication in these lattices which can be easily axiomatized and…
We show that the effective factorization of Ore polynomials over $\mathbb{F}_q(t)$ is still an open problem. This is so because the known algorithm in [1] presents two gaps, and therefore it does not cover all the examples. We amend one of…
We prove quantitative factorization results for several classes of operators, including weakly compact, Rosenthal, and $\xi$-Banach-Saks operators.
We show that the classifying category C(T) of a dependent type theory T with axioms for identity types admits a non-trivial weak factorisation system. We provide an explicit characterisation of the elements of both the left class and the…