Related papers: A Classification of Six Functor Formalisms via Str…
We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…
A series of works has established rewriting as an essential tool in order to prove coherence properties of algebraic structures, such as MacLane's coherence theorem for monoidal categories, based on the observation that, under reasonable…
Functorial semi-norms are semi-normed refinements of functors such as singular (co)homology. We investigate how different types of representability affect the (non-)triviality of finite functorial semi-norms on certain functors or classes.…
Starting from a description of various generalized function algebras based on sequence spaces, we develop the general framework for considering linear problems with singular coefficients or non linear problems. Therefore, we prove…
To any rigid analytic space (in the sense of Fujiwara-Kato) we assign an $\mathbb{A}^1$-invariant rigid analytic homotopy category with coefficients in any presentable category. We show some functorial properties of this assignment as a…
We give an introduction to constructive category theory by answering two guiding computational questions. The first question is: how do we compute the set of all natural transformations between two finitely presented functors like…
In this note, we provide some categorical perspectives on the relativization construction arising from quantum measurement theory in the presence of symmetries and occupying a central place in the operational approach to quantum reference…
A simple criterion for a functor to be finitary is presented: we call $F$ finitely bounded if for all objects $X$ every finitely generated subobject of $FX$ factorizes through the $F$-image of a finitely generated subobject of $X$. This is…
In this survey, we summarize some results in the literature involving the mesh category, which is a combinatorial representation of the category of modules over a finite-dimensional associative algebra. We discuss Riedtmann's well-behaved…
We study the mathematical foundations of physics. We reconstruct textbook quantum theory from a single symmetric monoidal functor $GNS : \mathbf{Phys} \longrightarrow \ast\mathbf{Mod}$, based on the Gelfand-Naimark-Segal construction and…
We describe a universal factorization for a functor with values in finite-dimensional measured algebras. More precisely we contruct the quantum automorphism group of this functor. This general recontruction result allows us to recapture a…
We consider notions of metrized categories, and then approximate categorical structures defined by a function of three variables generalizing the notion of $2$-metric space. We prove an embedding theorem giving sufficient conditions for an…
The goal is to construct three related "prismatization" functors from the category of p-adic formal schemes to that of formal stacks. This should provide a good category of coefficients for prismatic cohomology in the spirit of F-gauges. In…
We introduce the notion of symplectic microfolds and symplectic micromorphisms between them. They form a monoidal category, which is a version of the "category" of symplectic manifolds and canonical relations obtained by localizing them…
In this article, we study the properties of motivic homotopy category $\mathcal{SH}_{\operatorname{ext}}(\mathcal{X})$ developed by Chowdhury and Khan-Ravi for $\mathcal{X}$ a Nis-loc Stack. In particular, we compare the above construction…
We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…
We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…
We introduce a graphical language for closed symmetric monoidal categories based on an extension of string diagrams with special bracket wires representing internal homs. These bracket wires make the structure of the internal hom functor…
We show that single-variable polynomial functors over the category $\mathcal{S}$ of infinity groupoids, as defined by Gepner-Haugseng-Kock, are exactly colimits of representable copresheaves indexed by infinity groupoid. This allows us to…
Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…