Related papers: A complexity theory of constructible functions and…
We introduce constructible directed complexes, a combinatorial presentation of higher categories inspired by constructible complexes in poset topology. Constructible directed complexes with a greatest element, called atoms, encompass common…
We study concrete sheaf models for a call-by-value higher-order language with recursion. Our family of sheaf models is a generalization of many examples from the literature, such as models for probabilistic and differentiable programming,…
We describe the constructible derived category of sheaves on the $n$-sphere, stratified in a point and its complement, as a dg module category of a formal dg algebra. We prove formality by exploring two different methods: As a combinatorial…
We develop a theory of nearby and vanishing cycles in the context of finite-coefficient Zariski-constructible sheaves over a non-archimedean field which is non-trivially valued, complete, algebraically closed, and of mixed characteristic or…
We characterise the class of exponentiable $\infty$-toposes: $\mathcal X$ is exponentiable if and only if $\mathcal S\mathrm{h}(\mathcal X)$ is a continuous $\infty$-category. The heart of the proof is the description of the…
Studying crepant blow-ups of (compound) du Val singularities, we classify complexes of coherent sheaves which admit no negative self-extensions -- such a complex, up to flops and mutation equivalences, must either be (1) a module over a…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
We study the complexity of valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a \emph{constraint language}, a fixed set of cost functions over a finite domain. An instance of the problem is specified by…
One of the main prerequisites for understanding sheaves on elementary toposes is the proof that a (Lawvere-Tierney) topology on a topos induces a closure operator on it, and vice-versa. That standard theorem is usually presented in a…
An introduction is given to the logic of sheaves of structures and to set theoretic forcing constructions based on this logic. Using these tools, it is presented an alternative proof of the independence of the Continuum Hypothesis; which…
Cosheaves are a dual notion of sheaves. In this paper, we prove existence of a dual of sheafifications, called \textit{cosheafifications}, in the $\infty$-category theory. We also prove that the $\infty$-category of $\infty$-cosheaves is…
A measure for the complexity of a differentiable function f(x) on an interval is introduced. It is based on approximations of the function by piecewise constant functions. The measure takes into account the quality of the approximation and…
Let $f: X \to \mathbb{A}^1$ be a regular function on a smooth complex algebraic variety $X$. We formulate and prove an equivalence between the algebraic formal twisted de Rham complex of $f$ and the vanishing cycles with respect to $f$ as…
Toda \cite{Toda} proved in 1989 that the (discrete) polynomial time hierarchy, $\mathbf{PH}$, is contained in the class $\mathbf{P}^{#\mathbf{P}}$, namely the class of languages that can be decided by a Turing machine in polynomial time…
By a theorem of Chevalley the image of a morphism of varieties is a constructible set. The algebraic version of this fact is usually stated as a result on "extension of specializations" or "lifting of prime ideals". We present a difference…
Let G be an infinitesimal group scheme of finite height r and V(G) the scheme which represents 1-parameter subgroups of G. We consider sheaves over the projectivization P(G) of V(G) constructed from a G-module M. We show that if P(G) is…
In the previous part of this diptych, we defined the notion of an admissible simplicial connection, as well as explaining how H.I. Green constructed a resolution of coherent analytic sheaves by locally free sheaves on the \v{C}ech nerve.…
This paper establishes the separation of complexity classes $\mathbf{P}$ and $\mathbf{NP}$ through a novel homological algebraic approach grounded in category theory. We construct the computational category $\mathbf{Comp}$, embedding…
Inference in expressive probabilistic models is generally intractable, which makes them difficult to learn and limits their applicability. Sum-product networks are a class of deep models where, surprisingly, inference remains tractable even…
We prove that an enriched $\infty$-category is completely determined by its enriched presheaf category together with a `marking' by the representable presheaves. More precisely, for any presentably monoidal $\infty$-category $\mathcal{V}$…