Related papers: Syntactic approaches to opetopes
We give a simple algebraic description of opetopes in terms of chain complexes, and we show how this description is related to combinatorial descriptions in terms of treelike structures. More generally, we show that the chain complexes…
We give an elementary and direct combinatorial definition of opetopes in terms of trees, well-suited for graphical manipulation and explicit computation. To relate our definition to the classical definition, we recast the Baez-Dolan slice…
We give a definition of weak n-categories based on the theory of operads. We work with operads having an arbitrary set S of types, or `S-operads', and given such an operad O, we denote its set of operations by elt(O). Then for any S-operad…
We generalise the concepts introduced by Baez and Dolan to define opetopes constructed from symmetric operads with a category, rather than a set, of objects. We describe the category of 1-level generalised multicategories, a special case of…
We define a family of structures called "opetopic algebras", which are algebraic structures with an underlying opetopic set. Examples of such are categories, planar operads, and Loday's combinads over planar trees. Opetopic algebras can be…
In this paper, I introduce a new generalization of the concept of an operad, further generalizing the concept of an opetope introduced by Baez and Dolan, who used this for the definition of their version of non-strict $n$-categories.…
The concept of a system has proliferated through natural and social sciences. While myriad theories of systems exist, there is no mathematical general theory of systems. In this thesis, we take a first step towards formulating such a…
Decomposable models and Bayesian networks can be defined as sequences of oligo-dimensional probability measures connected with operators of composition. The preliminary results suggest that the probabilistic models allowing for effective…
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…
This paper follows from two earlier works. In the first we gave an explicit construction of opetopes, the underlying cell shapes in the theory of opetopic n-categories; at the heart of this construction is the use of certain trees. In the…
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…
We propose elementary definitions of opetopes and opetopic sets. We directly define opetopic sets by a simple structure and several axioms. Opetopes are then opetopic sets satisfying one more axiom. We show that our definition is equivalent…
We introduce the notion of a positive opetope and positive opetopic cardinals as certain finite combinatorial structures. The positive opetopic cardinals to positive-to-one polygraphs are like simple graphs to free omega-categories over…
Syntactic theory has traditionally adopted a constructivist approach, in which a set of atomic elements are manipulated by combinatory operations to yield derived, complex elements. Syntactic structure is thus seen as the result or discrete…
This note studies numerical methods for solving compositional optimization problems, where the inner function is smooth, and the outer function is Lipschitz continuous, non-smooth, and non-convex but exhibits one of two special structures…
In this paper, firstly, we introduce a higher-dimensional analogue of hypergraphs, namely $\omega$-hypergraphs. This notion is thoroughly flexible because unlike ordinary $\omega$-graphs, an n-dimensional edge called an n-cell has many…
The purpose of this dissertation is to set up a theory of generalized operads and multicategories, and to use it as a language in which to propose a definition of weak n-category. Included is a full explanation of why the proposed…
We describe a technique to obtain linear descriptions for polytopes from extended formulations. The simple idea is to first define a suitable lifting function and then to find linear constraints that are valid for the polytope and guarantee…
In order to gain a better understanding of the state space of programs, with the aim of making their verification more tractable, models based on directed topological spaces have been introduced, allowing to take in account equivalence…
We regard a geometric theory classified by a topos as a syntactic presentation for the topos and develop tools for finding such presentations. Extensions of geometric theories, which can add axioms, symbols and sorts, are treated as objects…