Related papers: Simplicial lists in operad theory I
Much research has been done on structures equivalent to topological or simplicial groups. In this paper, we consider instead simplicial monoids. In particular, we show that the usual model category structure on the category of simplicial…
In general, all constructions of algebraic topology are functorial; the notions of category, functor and natural transformation originated here. The arrow categories are more simple forms of the \emph{comma} categories and were introduced…
Vertex operator algebras are mathematically rigorous objects corresponding to chiral algebras in conformal field theory. Operads are mathematical devices to describe operations, that is, $n$-ary operations for all $n$ greater than or equal…
We construct a homotopy initial functor from the partition complex of a finite set $A$ to a category of trees with leaves labelled by $A$. As an application, this provides an equivalence between different bar constructions of an operad. In…
The concept of n-categories and related subject is considered. An n-category is described as an n-graph with a composition. A new definition of operad is presented. Some illustrative examples are given.
The most standard description of symmetries of a mathematical structure produces a group. However, when the definition of this structure is motivated by physics, or information theory, etc., the respective symmetry objects might become more…
We develop a rigorous, equation-free category-theoretic foundation for fungal organisation. A fungal organism is formalised as a functor from a category $\Env$ of structured environmental states and admissible transformations to a category…
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…
The arrows of a category are elements of particular sets, the hom-sets. These sets are functorial, and their functoriality specifies how to compose the arrows with other arrows of the same category. In particular, it allows to form…
`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…
Lenses are a well-established structure for modelling bidirectional transformations, such as the interactions between a database and a view of it. Lenses may be symmetric or asymmetric, and may be composed, forming the morphisms of a…
We study operads with trivial $\mathbb{A}$-actions and prove an equivalence between the category of $\mathbb{A}$-trivial operads and that of pseudo-graded-Perm associative algebras. As a consequence, we show that finitely generated…
The study of abstraction and composition - the focus of category theory - naturally leads to sophisticated diagrams which can encode complex algebraic semantics. Consequently, these diagrams facilitate a clearer visual comprehension of…
This paper formulates a notion of independence of subobjects of an object in a general (i.e. not necessarily concrete) category. Subobject independence is the categorial generalization of what is known as subsystem independence in the…
In this paper we first give a simplicial approach to the definition of a non strict $n$-category that we call an $n$-nerve following the idea that a category could be interpreted as a simplicial set, and we prove that our construction…
We show that the classification diagram of a relative $\infty$-category arising from a relative simplicial category is equivalent to the levelwise nerve. Applications include the comparison of the diagonal of the levelwise nerve and the…
We advance the foundational study of be Nardin-Shah's $\infty$-category of $G$-operads and their associated $\infty$-categories of algebras. In particular, we construct the underlying $G$-symmetric sequence of a (one color) $G$-operad,…
We introduce a general definition for colored cyclic operads over a symmetric monoidal ground category, which has several appealing features. The forgetful functor from colored cyclic operads to colored operads has both adjoints, each of…
We classify all fusion categories for a given set of fusion rules with three simple object types. If a conjecture of Ostrik is true, our classification completes the classification of fusion categories with three simple object types. To…
A syntax tree is a planar rooted tree where internal nodes are labeled on a graded set of generators. There is a natural notion of occurrence of contiguous pattern in such trees. We describe a way, given a set of generators $\mathfrak{G}$…