Related papers: Presenting Profunctors
In this paper we propose a categorical theory of intensionality. We first revisit the notion of intensionality, and discuss we its relevance to logic and computer science. It turns out that 1-category theory is not the most appropriate…
Unitary Ribbon Fusion Categories (URFC) formalize anyonic theories. It has been widely assumed that the same category formalizes a topological quantum computing model. However, in previous work, we addressed and resolved this confusion and…
We show that differential calculus (in its usual form, or in the general form of topological differential calculus) can be fully imdedded into a functor category (functors from a small category of anchord tangent algebras to anchored sets).…
Two novel descriptions of weak {\omega}-categories have been recently proposed, using type-theoretic ideas. The first one is the dependent type theory CaTT whose models are {\omega}-categories. The second is a recursive description of a…
We go back and forth between, on the one hand, presentations of arithmetic and Kac-Moody groups and, on the other hand, presentations of profinite groups, deducing along the way new results on both.
We develop and investigate a general theory of representations of second-order functionals, based on a notion of a right comodule for a monad on the category of containers. We show how the notion of comodule representability naturally…
In this work we propose a realization of Lurie's prediction that inner fibrations $p: X \rightarrow A$ are classified by $A$-indexed diagrams in a ``higher category" whose objects are $\infty$-categories, morphisms are correspondences…
We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…
These notes provide three contributions to the (well-established) representation theory of Dynkin and Euclidean quivers. They should be helpful as part of a direct approach to study representations of quivers, and they may shed some new…
To date, work on formalizing connectionist computation in a way that is at least Turing-complete has focused on recurrent architectures and developed equivalences to Turing machines or similar super-Turing models, which are of more…
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…
The arrows of a category are elements of particular sets, the hom-sets. These sets are functorial, and their functoriality specifies how to compose the arrows with other arrows of the same category. In particular, it allows to form…
We propose a framework for reasoning about programs that manipulate coinductive data as well as inductive data. Our approach is based on using equational programs, which support a seamless combination of computation and reasoning, and using…
We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…
This thesis contains various results on unitary 2-representations of finite groups and their 2-characters, as well as on pivotal structures for fusion categories. The motivation is extended topological quantum field theory (TQFT), where the…
The configuration category of a manifold is a topological category which we view as a Segal space, via the nerve construction. Our main result is that the unordered configuration category, suitably truncated, admits a finite presentation as…
We present {Kanren} (read: set-Kanren), an extension to miniKanren with constraints for reasoning about sets and association lists. {Kanren} includes first-class set objects, a functionally complete family of set-theoretic constraints…
We show here that the refined theorems for both lecture hall partitions and anti-lecture hall compositions can be obtained as straightforward consequences of two q-Chu Vandermonde identities, once an appropriate recurrence is derived. We…
For an additive category $\mathbf{P}$ we provide an explict construction of a category $\mathcal{Q}( \mathbf{P} )$ whose objects can be thought of as formally representing $\frac{\mathrm{im}( \gamma )}{\mathrm{im}( \rho ) \cap \mathrm{im}(…
We provide a bicategorical generalization of Barr's landmark 1970 paper, in which he describes how to extend Set-monads to relations and uses this to characterize topological spaces as the relational algebras of the ultrafilter monad. With…