Related papers: The Web Monoid and Opetopic Sets
Diagrammatic sets are presheaves on a rich category of shapes, whose definition is motivated by combinatorial topology and higher-dimensional diagram rewriting. These shapes include representatives of oriented simplices, cubes, and positive…
We firstly present definitions and properties in study of Maji \cite{maji-2013} on neutrosophic soft sets. We then give a few notes on his study. Next, based on \c{C}a\u{g}man \cite{cagman-2014}, we redefine the notion of neutrosophic soft…
In the first part, we develop layered monoidal theories - a generalisation of monoidal theories combining descriptions of a system at several levels. Via their representation as string diagrams, monoidal theories provide a graphical syntax…
For a directed polytope, we construct a colored operad whose Poincare-Hilbert series encodes certain operations on the cellular complex of the polytope. We conjecture that for a class of short polytopes the constructed operads are Koszul…
We study the $2$-categories BIon, of (generalized) bounded ionads, and $\text{Acc}_\omega$, of accessible categories with directed colimits, as an abstract framework to approach formal model theory. We relate them to topoi and (lex)…
Type-and-effect systems incorporate information about the computational effects, e.g., state mutation, probabilistic choice, or I/O, a program phrase may invoke alongside its return value. A semantics for type-and-effect systems involves a…
We introduce monoidal width as a measure of complexity for morphisms in monoidal categories. Inspired by well-known structural width measures for graphs, like tree width and rank width, monoidal width is based on a notion of syntactic…
We develop the theory of (op)fibrations of 2-multicategories and use it to define abstract six-functor-formalisms. We also give axioms for Wirthm\"uller and Grothendieck formalisms (where either $f^!=f^*$ or $f_!=f_*$) or intermediate…
The main purpose of this article is to pose three problems which are easy to be formulated in an elementary way. These problems which are specifically important also for the new class of partially ordered sets seem to be not yet solved.
Humans possess the capability to reason at an abstract level and to structure information into abstract categories, but the underlying neural processes have remained unknown. Experimental evidence has recently emerged for the organization…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
This is the first paper of a series which aims to set up the cornerstones of Koszul duality for operads over operadic categories. To this end we single out additional properties of operadic categories under which the theory of quadratic…
We generalize Berger and Moerdijk's results on axiomatic homotopy theory for operads to the setting of enriched symmetric monoidal model categories, and show how this theory applies to orthogonal spectra. In particular, we provide a…
Many systems of interest in science and engineering are made up of interacting subsystems. These subsystems, in turn, could be made up of collections of smaller interacting subsystems and so on. In a series of papers David Spivak with…
In this short notes we propose a new notion of contractibility for coloured $\omega$-operad defined in the article published in Cahiers de Topologie et de G{\'e}om{\'e}trie Diff{\'e}rentielle Cat{\'e}gorique (2011), volume 4. We propose…
Network models, which abstractly are given by lax symmetric monoidal functors, are used to construct operads for modeling and designing complex networks. Many common types of networks can be modeled with simple graphs with edges weighted by…
We introduce structured decompositions, category-theoretic structures which simultaneously generalize notions from graph theory (including treewidth, layered treewidth, co-treewidth, graph decomposition width, tree independence number,…
This paper examines operad structures derived from poset matrices by formulating a set of new construction rules for poset matrices. In this direction, eleven different partial composition operations will be introduced as the basis for the…
Monads are of interest both in semantics and in higher dimensional algebra. It turns out that the idea behind usual notion finitary monads (whose values on all sets can be computed from their values on finite sets) extends to a more general…
We define a diagrammatic category that is equivalent to tilting representations for the orthogonal group. Our construction works in characteristic not equal to two. We also describe the semisimplification of this category.