Related papers: Higher-Order Quantum Objects are Strong Profunctor…
Quantum contextuality, a fundamental feature distinguishing quantum theory from classical models, is investigated via algebraic and topological structures inherent in modular tensor categories. This work rigorously demonstrates that braid…
It is characterized when coarsening functors between categories of graded modules preserve injectivity of objects, and when they commute with graded covariant Hom functors.
Given a category $\mathcal{E}$, we establish sufficient conditions on a faithful isofibration $\mathcal{E}\rightarrow\operatorname{Mon}(\mathcal{V})$ valued in the category of monoids internal to a monoidal additive category $\mathcal{V}$…
Can causal relations be subject to quantum indefiniteness, similar to other physical properties? The process-matrix framework formalises this possibility: valid processes are defined by what local laboratories can implement, without…
Various models of $(\infty,1)$-categories, including quasi-categories, complete Segal spaces, Segal categories, and naturally marked simplicial sets can be considered as the objects of an $\infty$-cosmos. In a generic $\infty$-cosmos, whose…
In order to avoid well-know paradoxes associated with self-referential definitions, higher-order dependent type theories stratify the theory using a countably infinite hierarchy of universes (also known as sorts), Type$_0$ : Type$_1$ :…
This work addresses the design of multi-agent coordination through high-order consensus protocols. While first-order consensus strategies are well-studied -- with known robustness to uncertainties such as time delays, time-varying weights,…
We derive curvature counterterms in two-dimensional gravity coupled to conformal matter up to infinite order. By construction the higher-order action is equivalent to a finite first-order theory with auxiliary scalar. Due to this…
Let $\mathcal C$ be a category with finite colimits, writing its coproduct $+$, and let $(\mathcal D, \otimes)$ be a braided monoidal category. We describe a method of producing a symmetric monoidal category from a lax braided monoidal…
We reformulate recent advances in directed type theory--a type theory where the types have the structure of synthetic (higher) categories--as a logical calculus with multiple context 'zones', following the example of Pfenning and Davies.…
Brouwer's constructivist foundations of mathematics is based on an intuitively meaningful notion of computation shared by all mathematicians. Martin-L\"of's meaning explanations for constructive type theory define the concept of a type in…
We study limits in 2-categories whose objects are categories with extra structure and whose morphisms are functors preserving the structure only up to a coherent comparison map, which may or may not be required to be invertible. This is…
We consider the 3-category $2\mathfrak{C}at$ whose objects are 2-categories, 1-morphisms are lax functors, 2-morphisms are lax transformations and 3-morphisms are modifications. The aim is to show that it carries interesting…
If $\mathscr{M}$ is a model category and $\mathcal{U}: \mathscr{A} \rightarrow \mathscr{M}$ is a functor, we defined a Quillen-Segal $\mathcal{U}$-object as a weak equivalence $\mathscr{F}: s(\mathscr{F}) \xrightarrow{\sim} t(\mathscr{F})$…
We propose a type-theoretic framework for describing and proving properties of quantum computations, in particular those presented as quantum circuits. Our proposal is based on an observation that, in the polymorphic type system of Coq,…
Modular functors, i.e. consistent systems of projective representations of mapping class groups of surfaces, have been constructed for non-semisimple modular categories already decades ago. Concepts from homological algebra have not been…
In classical set theory, there are many equivalent ways to introduce ordinals. In a constructive setting, however, the different notions split apart, with different advantages and disadvantages for each. We consider three different notions…
Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…
In this paper we construct an analogue of Lurie's "unstraightening" construction that we refer to as the "comprehension construction". Its input is a cocartesian fibration $p \colon E \to B$ between $\infty$-categories together with a third…
Local superlinear convergence of the semismooth Newton method usually necessitates assumptions on the uniform invertibility of the utilized, generalized Jacobian matrices, such as, e.g., BD- or CD-regularity. For certain composite-type…