Related papers: Pseudo-functors modelling higher structures

There is an ``algebraisation'' of the notion of weak factorisation system (w.f.s.) known as a natural weak factorisation system. In it, the two classes of maps of a w.f.s. are replaced by two categories of maps-with-structure, where the…

Categories, n-categories, double categories, and multicategories (among others) all have similar definitions as collections of cells with composition operations. We give an explicit description of the information required to define any…

We classify the module categories over the double (possibly twisted) of a finite group.

We show in this work that homology in degree d of a congruence group, in a very general framework, defines a weakly polynomial functor of degree at most 2d and we describe this functor modulo polynomial functors of smaller degree. Our main…

We prove a strong non-structure theorem for a class of metric structures with an unstable pair of formulae. As a consequence, we show that weak categoricity (that is, categoricity up to isomorphisms and not isometries) implies several…

This article describe globular weak $(n,\infty)$-transformations ($n\in\mathbb{N}$) in the sense of Grothendieck, i.e for each $n\in\mathbb{N}$ we build a coherator $\Theta^{\infty}_{\mathbb{M}^n}$ which sets models are globular weak…

In this paper we apply some tools developed in our previous work on Grothendieck $\infty$-groupoids to the finite-dimensional case of weak 3-groupoids. We obtain a semi-model structure on the category of Grothendieck 3-groupoids of suitable…

We develop a notion of cell decomposition suitable for studying weak p- adic structures (reducts of p-adic fields where addition and multiplication are not (everywhere) definable). As an example, we apply this to a language with restricted…

Let $M$ be G-graded R-module. The idea of a graded weakly primal submodule of $M$, which is a generalization of a graded primal submodule, is introduced and discussed in this paper. Some characteristics and characterizations are assigned to…

We develop a symbolic computational approach to classifying low-rank modular categories. We use this technique to classify pseudo-unitary modular categories of rank at most 5 that are non-self-dual, i.e. those for which some object is not…

This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is $\Delta^0_2$ categorical. A structure A is said to be weakly ultrahomogeneous if there is a…

We present a new strictification method for type-theoretic structures that are only weakly stable under substitution. Given weakly stable structures over some model of type theory, we construct equivalent strictly stable structures by…

We give a new construction for rigidifying a quasi-category into a simplicial category, and prove that it is weakly equivalent to the rigidification given by Lurie. Our construction comes from the use of necklaces, which are simplicial sets…

In the present article, we describe constructions of model structures on general bicomplete categories. We are motivated by the following question: given a category $\mathcal{C}$ with a subcategory $w\mathcal{C}$ closed under retracts, when…

Variations on the notions of Reedy model structures and projective model structures on categories of diagrams in a model category are introduced. These allow one to choose only a subset of the entries when defining weak equivalences, or to…

The principles behind the sharp, singular structures in a crumpled sheet are well understood. Here we discuss more general ways of exploiting such sharp structures to control the shape of a sheet by deforming or forcing it elsewhere. Often,…

We give a new description of computads for weak globular $\omega$-categories by giving an explicit inductive definition of the free words. This yields a new understanding of computads, and allows a new definition of $\omega$-category that…

A new categorical setting is defined in order to characterize the subrecursive classes belonging to complexity hierarchies. This is achieved by means of coercion functors over a symmetric monoidal category endowed with certain recursion…

We recall the notions of a graded cocategory, conilpotent cocategory, morphisms of such (cofunctors), coderivations and define their analogs in $\mathbb L$-filtered setting. The difference with the existing approaches: we do not impose any…

Let $R$ be a $G$-graded ring. In this article, we introduce two new concepts on graded rings, namely, weakly graded rings and invertible graded rings, and we discuss the relations between these concepts and several properties of graded…