Related papers: The Dwyer-Kan model structure for enriched coloure…
We introduce an explicit combinatorial characterization of the minimal model ${\cal O}_{\infty}$ of the coloured operad ${\cal O}$ encoding non-symmetric operads. In our description of ${\cal O}_{\infty}$, the spaces of operations are…
In this paper we introduce the notion of weak operator and the theory of Yetter-Drinfeld modules over a weak braided Hopf algebra with invertible antipode in a strict monoidal category. We prove that the class of such objects constitutes a…
Joyal and Street note in their paper on braided monoidal categories [Braided tensor categories, Advances in Math. 102(1993) 20-78] that the 2-category V-Cat of categories enriched over a braided monoidal category V is not itself braided in…
The small object argument is a method for transfinitely constructing weak factorization systems originally motivated by homotopy theory. We establish a variant of the small object argument that is enriched over a cofibrantly generated weak…
It is shown how double categories provide a direct abstract approach to coloured operads; namely, product-preserving normal lax functors from (Pb C)^op (the opposite of the double category of pullback squares in C) to Cat (the double…
We develop a topological framework in an attempt to generalize the classical colourful Caratheodory theorem by imposing an additional constraint. For that we introduce the notion of zero-avoding complexes and covering criteria for the…
I show that the theories of enrichment in a monoidal infinity-category defined by Hinich and by Gepner-Haugseng agree, and that the identification is unique. Among other things, this makes the Yoneda lemma available in the former model.
We develop a theory of categories which are simultaneously (1) indexed over a base category S with finite products, and (2) enriched over an S-indexed monoidal category V. This includes classical enriched categories, indexed and fibered…
Let $\mathcal C$ be a category with finite colimits, writing its coproduct $+$, and let $(\mathcal D, \otimes)$ be a braided monoidal category. We describe a method of producing a symmetric monoidal category from a lax braided monoidal…
The notion of color algebras is generalized to the class of F-ary algebras, and corresponding decoloration theorems are established. This is used to give a construction of colored structures by means of tensor products with Clifford-like…
Baez-Dolan type plus constructions serve three main purposes: They (1) corepresent categorical bimodules that are monoids with respect to a plethysm product, (2) allow to define functors as bimodule monoids, and thereby algebras over…
We present results on the existence of long arithmetic progressions in the Thue-Morse word and in a class of generalised Thue-Morse words. Our arguments are inspired by van der Waerden's proof for the existence of arbitrary long…
We study the category of wheeled PROPs using tools from Invariant Theory. A typical example of a wheeled PROP is the mixed tensor algebra ${\mathcal V}=T(V)\otimes T(V^\star)$, where $T(V)$ is the tensor algebra on an $n$-dimensional vector…
We consider a class of stable smoothable n-dimensional varieties, the analogs of stable curves. Assuming the minimal model program in dimension n+1, we prove that this class is bounded. From Kollar's method of constructing projective moduli…
A version of Dwyer-Kan localization in the context of infinity-categories and simplicial categories is presented. Some results of the classical papers by Dwyer and Kan on simplicial localization are reproven and generalized. It is proven…
We introduce and study wheeled PROPs, an extension of the theory of PROPs which can treat traces and, in particular, solutions to the master equations which involve divergence operators. We construct a dg free wheeled PROP whose…
We propose a minimal embedding of the Standard Model spectrum in a D-brane configuration of type I string theory. The SU(3) color and SU(2) weak interactions arise from two different collections of branes. The model is neither grand unified…
We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…
The pre-coloring extension problem consists, given a graph $G$ and a subset of nodes to which some colors are already assigned, in finding a coloring of $G$ with the minimum number of colors which respects the pre-coloring assignment. This…
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…