Related papers: Understanding the small object argument

Factorization models express a statistical object of interest in terms of a collection of simpler objects. For example, a matrix or tensor can be expressed as a sum of rank-one components. However, in practice, it can be challenging to…

We consider algorithms for the factorization of linear partial differential operators. We introduce several new theoretical notions in order to simplify such considerations. We define an obstacle and a ring of obstacles to factorizations.…

Small, finite entities are easier and simpler to manipulate than gigantic, infinite ones. Consequently huge chunks of mathematics are devoted to methods reducing the study of big, cumbersome objects to an analysis of their finite building…

Humans have the innate capability to answer diverse questions, which is rooted in the natural ability to correlate different concepts based on their semantic relationships and decompose difficult problems into sub-tasks. On the contrary,…

In this paper, we address the problem of change in an abstract argumentation system. We focus on a particular change: the addition of a new argument which interacts with previous arguments. We study the impact of such an addition on the…

The main purpose of this paper is to show that the converse of the known implication weakly action representable implies action accessible is false. In particular we show that both action accessibility, as well as the (at least formally…

For C a factorisable and pivotal finite tensor category over an algebraically closed field of characteristic zero we show: 1) C always contains a simple projective object; 2) if C is in addition ribbon, the internal characters of projective…

We find that second order quantification is problematic when a quantified concept variable is supposed to function predicatively. This issue is analyzed and it is shown that a constructive interpretation of the falling under relation…

A factorization of a permutation into transpositions is called "primitive" if its factors are weakly ordered. We discuss the problem of enumerating primitive factorizations of permutations, and its place in the hierarchy of previously…

We introduce the basic elements of the theory of parametrized $\infty$-categories and functors between them. These notions are defined as suitable fibrations of $\infty$-categories and functors between them. We give as many examples as we…

We prove several new results on the structure of the subgroup generated by a small doubling subset of an ordered group, abelian or not. We obtain precise results generalizing Freiman's 3k-3 and 3k-2 theorems in the integers and several…

In this paper we put a cofibrantly generated model category structure on the category of small simplicial categories. The weak equivalences are a simplicial analogue of the notion of equivalence of categories.

The goal of this paper is to address the problem of building a path object for the category of Grothendieck (weak) $\infty$-groupoids. This is the missing piece for a proof of Grothendieck's homotopy hypothesis. We show how to endow the…

Let $\mathcal T$ be a well generated triangulated category, and let $S\subset\mathcal T$ be a set of objects. We prove that there is a t-structure on $\mathcal T$ with ${\mathcal T}^{\leq0}=\overline{\langle S\rangle}^{(-\infty,0]}$. This…

Given a simple Lie algebra $\mathfrak{g}$ and an element $\mu\in\mathfrak{g}^*$, the corresponding shift of argument subalgebra of $\text{S}(\mathfrak{g})$ is Poisson commutative. In the case where $\mu$ is regular, this subalgebra is known…

Classification theory of elementary classes deals with first order (elementary) classes of structures (i.e. fixing a set T of first order sentences, we investigate the class of models of T with the elementary submodel notion). It tries to…

Examples are given of profinite groups that are not strongly complete, and have other `bad' properties, yet have only finitely many open subgroups of each finite index. It is shown that a profinite group with the latter property must be…

Let $a > 1$. Then $a^n < n!$ for some positive integer $n$. We show that the smallest such $n$ is one of a pair of possibilities, or is one possibility, which we show how to calculate. There are three interesting numerical sequences which…

We define a simple kind of higher inductive type generalising dependent $W$-types, which we refer to as $W$-types with reductions. Just as dependent $W$-types can be characterised as initial algebras of certain endofunctors (referred to as…

The theory of small cancellation groups is well known. In this paper we introduce the notion of Group-like Small Cancellation Ring. This is the main result of the paper. We define this ring axiomatically, by generators and defining…