Related papers: Stable factorization from a fibred algebraic weak …

We first prove semi-orthogonal decompositions of derived factorization categories arising from sums of potentials of gauged Landau-Ginzburg models, where the sums are not necessarily Thom--Sebastiani type. We then apply the result to the…

We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…

We present an efficient algorithm for computing the permanent for matrices of size N that can written as a product of L block diagonal matrices with blocks of size at most 2. For fixed L, the time and space resources scale linearly in N,…

We present a matrix-factorization algorithm that scales to input matrices with both huge number of rows and columns. Learned factors may be sparse or dense and/or non-negative, which makes our algorithm suitable for dictionary learning,…

We present a family of distributed forward-backward methods with variable stepsizes to find a solution of structured monotone inclusion problems. The framework is constructed by means of relocated fixed-point iterations, extending the…

Let $\bf T$ be the group of diagonal matrices in $SL_2(\bar{\mathbb{F}}_p)$, where $p$ is a prime number. Let $\Bbbk$ be an algebraically closed field of characteristic not equal to $2$ and $p$. We classify all the irreducible…

For large-scale discrete-time algebraic Riccati equations (DAREs) with high-rank nonlinear and constant terms, the stabilizing solutions are no longer numerically low-rank, resulting in the obstacle in the computation and storage. However,…

We give an expository review of applications of computational algebraic statistics to design and analysis of fractional factorial experiments based on our recent works. For the purpose of design, the techniques of Gr\"obner bases and…

We characterize $t$-structures in stable $\infty$-categories as suitable quasicategorical factorization systems. More precisely we show that a $t$-structure $\mathfrak{t}$ on a stable $\infty$-category $\mathbf{C}$ is equivalent to a normal…

We introduce categories of weak factorization algebras and factorization spaces, and prove that they are equivalent to the categories of ordinary factorization algebras and spaces, respectively. This allows us to define the pullback of a…

We study the category of matrix factorizations associated to the germ of an isolated hypersurface singularity. This category is shown to admit a compact generator which is given by the stabilization of the residue field. We deduce a…

The aim of this paper is twofold. First, we introduce a new class of linearizations, based on the generalization of a construction used in polynomial algebra to find the zeros of a system of (scalar) polynomial equations. We show that one…

We introduce notions of stationarily ordered types and theories; the latter generalizes weak o-minimality and the first is a relaxed version of weak o-minimality localized at the locus of a single type. We show that forking, as a binary…

After a brief introduction to the problem of subtraction of infrared divergences for high-order collider observables, we present a preliminary study of strongly-ordered soft and collinear multiple radiation from the point of view of…

This paper is an expository account of the theory of stable infinity categories. We prove that the homotopy category of a stable infinity category is triangulated, and that the collection of stable infinity categories is closed under a…

For $\alpha \in (1,2]$, the $\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\alpha$-dependent power-law tail behavior. It consists of a sequence of compact measured…

We show that a fast algorithm for the QR factorization of a Toeplitz or Hankel matrix A is weakly stable in the sense that R^T.R is close to A^T.A. Thus, when the algorithm is used to solve the semi-normal equations R^T.Rx = A^Tb, we obtain…

Delta lenses are functors equipped with a suitable choice of lifts, and are used to model bidirectional transformations between systems. In this paper, we construct an algebraic weak factorisation system whose R-algebras are delta lenses.…

Tabular data learning has extensive applications in deep learning but its existing embedding techniques are limited in numerical and categorical features such as the inability to capture complex relationships and engineering. This paper…

Extriangulated categories, introduced by Nakaoka and Palu, serve as a simultaneous generalization of exact and triangulated categories. In this paper, we first introduce the concept of admissible weak factorization systems and establish a…