Related papers: Resolutions in factorization categories
We introduce a Bayesian perspective for the structured matrix factorization problem. The proposed framework provides a probabilistic interpretation for existing geometric methods based on determinant minimization. We model input data…
The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see [1]). We present a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a…
To formalize calculations in linear algebra for the development of efficient algorithms and a framework suitable for functional programming languages and faster parallelized computations, we adopt an approach that treats elements of linear…
We emphasize two connections, one well known and another less known, between the dissipative nonlinear second order differential equations and the Abel equations which in its first kind form have only cubic and quadratic terms. Then,…
Factorization machines and polynomial networks are supervised polynomial models based on an efficient low-rank decomposition. We extend these models to the multi-output setting, i.e., for learning vector-valued functions, with application…
We give integrable quad equations which are multi-quadratic (degree-two) counterparts of the well-known multi-affine (degree-one) equations classified by Adler, Bobenko and Suris (ABS). These multi-quadratic equations define multi-valued…
We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these…
We study the categories of singularities coming from Landau-Ginzburg models given by the invertible polynomials. Such categories appear on the B-side of the Berglund-H\"ubsch mirror symmetry. We provide an efficient method of computing…
We construct an "almost involution" assigning a new DG-category to a given one, and use this construction to recover, say, the abelian category of graded modules over the graded ring $R^*$ from the DG-category of DG-modules over a DG-ring…
We develop parametrized generalizations of a number of fundamental concepts in the theory of $\infty$-categories, including factorization systems, free fibrations, exponentiable fibrations, relative colimits and relative Kan extensions,…
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…
For a certain class of abelian categories, we show how to make sense of the "Euler characteristic" of an infinite projective resolution (or, more generally, certain chain complexes that are only bounded above), by passing to a suitable…
In this article, we functorially associate definable sets to $k$-analytic curves, and definable maps to analytic morphisms between them, for a large class of $k$-analytic curves. Given a $k$-analytic curve $X$, our association allows us to…
The roles played by decision factors in making complex subject are decisions are characterized by how these factors affect the overall decision. Evidence that partially matches a factor is evaluated, and then effective computational rules…
We provide descriptions of the derived categories of degree $d$ hypersurface fibrations which generalize a result of Kuznetsov for quadric fibrations and give a relative version of a well-known theorem of Orlov. Using a local generator and…
We describe a procedure for constructing morphisms in additive categories, combining Auslander's concept of a morphism determined by an object with the existence of flat covers. Also, we show how flat covers are turned into projective…
`Categorification' is the process of replacing equations by isomorphisms. We describe some of the ways a thoroughgoing emphasis on categorification can simplify and unify mathematics. We begin with elementary arithmetic, where the category…
Factorization-based models have gained popularity since the Netflix challenge {(2007)}. Since that, various factorization-based models have been developed and these models have been proven to be efficient in predicting users' ratings…
We study the class of those linear relations that can be factorized as products of idempotent relations. We provide several characterizations of this class, extending known factorization results for operators to the more general setting of…
We give an alternative proof of the theorem by Kuznetsov and Lunts, stating that any separated scheme of finite type over a field of characteristic zero admits a categorical resolution of singularities. Their construction makes use of the…