Related papers: Computads and Multitopic Sets
We define the category of tidy symmetric multicategories. We construct for each tidy symmetric multicategory Q a cartesian monad (E_Q,T_Q) and extend this assignation to a functor. We exhibit a relationship between the slice construction on…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
We introduce a notion of a filtered model structure and use this notion to produce various model structures on pro-categories. This framework generalizes several known examples. We give several examples, including a homotopy theory for…
The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…
To a bicomplex one can associate two natural filtrations, the column and row filtrations, and then two associated spectral sequences. This can be generalized to $N$-multicomplexes. We present a family of model category structures on the…
We generalize the construction of multitildes in the aim to provide multitilde operators for regular languages. We show that the underliying algebraic structure involves the action of some operads. An operad is an algebraic structure that…
In this paper we introduce the notion of an Open Non-uniform Cylindrical Algebraic Decomposition (NuCAD), and present an efficient model-based algorithm for constructing an Open NuCAD from an input formula. A NuCAD is a generalization of…
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.
Diagrammatic sets admit a notion of internal equivalence in the sense of coinductive weak invertibility, with similar properties to its analogue in strict $\omega$-categories. We construct a model structure whose fibrant objects are…
A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…
We address the fact that composition in an opetopic weak n-category is in general not unique and hence is not a well-defined operation. We define composition with a given k-cell in an n-category by a span of (n-k)-categories. We…
Hyperdimensional (HD) computing is built upon its unique data type referred to as hypervectors. The dimension of these hypervectors is typically in the range of tens of thousands. Proposed to solve cognitive tasks, HD computing aims at…
We introduce $\omega$-catoids as generalisations of (strict) $\omega$-categories and in particular the higher path categories generated by computads or polygraphs in higher-dimensional rewriting. We also introduce $\omega$-quantales that…
In this paper, we provide a comprehensive rigorous modeling for multidimensional spaces with hierarchically structured dimensions in several layers of abstractions and data cubes that live in such spaces. We model cube queries and their…
Category theory unifies mathematical concepts, aiding comparisons across structures by incorporating objects and morphisms, which capture their interactions. It has influenced areas of computer science such as automata theory, functional…
We form tricategories and the homomorphisms between them into a bicategory, whose 2-cells are certain degenerate tritransformations. We then enrich this bicategory into an example of a three-dimensional structure called a locally cubical…
From the polynomial approach to the definition of opetopes of Kock et al., we derive a category of opetopes, and show that its set-valued presheaves, or opetopic sets, are equivalent to many-to-one polygraphs. As an immediate corollary, we…
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
A multicategory is what remains of a monoidal category when monoidal product is not available. A weak multicategory means that hom-sets are in fact categories, and in place of usual equations, there are natural isomorphisms, which have to…
We define a variety of notions of cubical sets, based on sites organized using substructural algebraic theories presenting PRO(P)s or Lawvere theories. We prove that all our sites are test categories in the sense of Grothendieck, meaning…