Related papers: Invertible cells in $\omega$-categories

In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data $\omega$-words). The notion of computability is defined through Turing machines with infinite inputs which can…

In this paper we classify invariant noncommutative connections in the framework of the algebra of endomorphisms of a complex vector bundle. It has been proven previously that this noncommutative algebra generalizes in a natural way the…

Bijections between sets may be seen as discrete (or crisp) unitary transformations used in quantum computations. So discrete quantum cellular automata are cellular automata with reversible transition functions. This note studies on 1d…

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…

As an example of the categorical apparatus of pseudo algebras over 2-theories, we show that pseudo algebras over the 2-theory of categories can be viewed as pseudo double categories with folding or as appropriate 2-functors into…

Let $\mathcal{A}$ be a essentially small abelian category and $\mathcal{C}$ be a Serre subcategory of $\mathcal{A}$. Consider the quotient functor $q:\mathcal{A}\rightarrow \mathcal{A}/\mathcal{C}$. For an object $A\in \mathcal{A}$ and a…

Consider the intrinsic fundamental group \`a la Grothendieck of a linear category using connected gradings. In this article we prove that any full convex subcategory is incompressible, in the sense that the group map between the…

We study strongly graded vertex algebras and their strongly graded modules, which are conformal vertex algebras and their modules with a second, compatible grading by an abelian group satisfying certain grading restriction conditions. We…

Every bounded definable open set is a union of finitely many open strong cells in a weakly o-minimal expansion of a real closed field. We prove this fact and another theorem similar to it.

Let V be a vertex operator algebra, and for k a positive integer, let g be a k-cycle permutation of the vertex operator algebra V^{\otimes k}. We prove that the categories of weak, weak admissible and ordinary g-twisted modules for the…

This article develops a theory of cell combinatorics and cell 2-representations for differential graded 2-categories. We introduce two types of partial preorders, called the strong and weak preorder. We then analyse and compare them. The…

We study the dependent type theory CaTT, introduced by Finster and Mimram, which presents the theory of weak $\omega$-categories, following the idea that type theories can be considered as presentations of generalized algebraic theories.…

A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…

A set of integers $A$ is computably encodable if every infinite set of integers has an infinite subset computing $A$. By a result of Solovay, the computably encodable sets are exactly the hyperarithmetic ones. In this paper, we extend this…

We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…

We develop the theory of categories of measurable fields of Hilbert spaces and bounded fields of bounded operators. We examine classes of functors and natural transformations with good measure theoretic properties, providing in the end a…

In functional programming, datatypes a la carte provide a convenient modular representation of recursive datatypes, based on their initial algebra semantics. Unfortunately it is highly challenging to implement this technique in proof…

Let $T$ be an absolutely continuous polynomially bounded operator, and let $\theta$ be a singular inner function. It is shown that if $\theta(T)$ is invertible and some additional conditions are fulfilled, then $T$ has nontrivial…

We prove that a finite braided tensor category A is invertible in the Morita 4-category BrTens of braided tensor categories if, and only if, it is non-degenerate. This includes the case of semisimple modular tensor categories, but also…