Related papers: Diagrammatic sets and rewriting in weak higher cat…

We proved in a previous work that Cattani-Sassone's higher dimensional transition systems can be interpreted as a small-orthogonality class of a topological locally finitely presentable category of weak higher dimensional transition…

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 introduce the notion of directed diagrammatic reducibility which is a relative version of diagrammatic reducibility. Directed diagrammatic reducibility has strong group theoretic and topological consequences. A multi-relator version of…

Let $G$ be a unipotent group over a field of characteristic $p > 0$. The theory of character sheaves on $G$ was initiated by V. Drinfeld and developed jointly with D. Boyarchenko. They also introduced the notion of $\mathbb{L}$-packets of…

The theory of finite and infinitary term rewriting is extensively developed for orthogonal rewrite systems, but to a lesser degree for weakly orthogonal rewrite systems. In this note we present some contributions to the latter case of weak…

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 show how decreasing diagrams introduced in the theory of rewriting systems can be used to prove coherence type theorems in category theory. We apply this method to describe a coherent presentation of the $0$-Hecke monoid…

Algorithmic meta-theorems explain the tractability of large classes of computational problems by linking logical expressibility with structural graph properties. While extensions of first-order logic such as FO+dp admit efficient model…

Given a dimension function $\omega$, we define a notion of an $\omega$-vector weighted digraph and an $\omega$-equivalence between them. Then we establish a bijection between the weakly $(\mathbb{Z}/2)^n$-equivariant homeomorphism classes…

This paper, written in 1998, aims to clarify various higher categorical structures, mostly through the theory of generalized operads and multicategories. Chapters I and II, which cover this theory and its application to give a definition of…

It is well known that strict $\omega$-categories, strict $\omega$-functors, strict natural $\omega$-transformations, and so on, form a strict $\omega$-category. A similar property for weak $\omega$-categories is one of the main hypotheses…

In this short note, we classify linear categorified open topological field theories in dimension two by pivotal Grothendieck-Verdier categories, a type of monoidal category equipped with a weak, not necessarily rigid duality. In combination…

This article explains and extends semialgebraic homotopy theory (developed by H. Delfs and M. Knebusch) to o-minimal homotopy theory (over a field). The homotopy category of definable CW-complexes is equivalent to the homotopy category of…

We study a new type of higher categorical structure, called weakly globular n-fold category, previously introduced by the author. We show that this structure is a model of weak n-categories by proving that it is suitably equivalent to the…

The paper establishes an equivalence between directed homotopy categories of (diagrams of) cubical sets and (diagrams of) directed topological spaces. This equivalence both lifts and extends an equivalence between classical homotopy…

We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world…

The weak minor G of a graph G is the graph obtained from G by a sequence of edge-contraction operations on G. A weak-minor-closed family of upper embeddable graphs is a set G of upper embeddable graphs that for each graph G in G, every weak…

We introduce a new higher categorical structure called a weakly globular n-fold category. This structure is based on iterated internal categories and on the notion of weak globularity. We identify a suitable class of pseudo-functors whose…

We study the canonical weak distributive law $\delta$ of the powerset monad over the semimodule monad for a certain class of semirings containing, in particular, positive semifields. For this subclass we characterise $\delta$ as a convex…

We present our position on the elusive quest for a general-purpose framework for specifying and studying deep learning architectures. Our opinion is that the key attempts made so far lack a coherent bridge between specifying constraints…