Related papers: A Computable Functor From Graphs to Fields
For every functor $\mathcal{F} : \mathcal{K} \to \mathbf{C}$, where $\mathcal{K}$ is a small category and $\mathbf{C}$ is a model category which satisfies some mild hypotheses, we define a model category $\mathbf{C}^m$ of…
We call an Ising model tractable when it is possible to compute its partition function value (statistical inference) in polynomial time. The tractability also implies an ability to sample configurations of this model in polynomial time. The…
One of the fundamental results in computability is the existence of well-defined functions that cannot be computed. In this paper we study the effects of data representation on computability; we show that, while for each possible way of…
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where…
We discuss a systematic procedure for categorifying presentable six-functor formalisms. Our main result produces, given the input of a representation of the $\infty$-category of correspondences of an $\infty$-category with finite limits…
A simple explanation of the flavor hierarchies can arise if matter fields interact with a conformal sector and different generations have different anomalous dimensions under the CFT. However, in the original study by Nelson and Strassler…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
We show that the functor from curved differential graded algebras to differential graded categories, defined by the second author in [B], sends Cartesian diagrams to homotopy Cartesian diagrams, under certain reasonable hypotheses. This is…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
In these notes we generalize the theory of graphical functions from scalar theories to theories with spin.
We construct a functor from the category of admissible finitely presented o-representations of GL(2,F) to the category of finite length o-representations of Gal_{Q_p}, for any finite extension F of Q_p and the ring of integers o of a finite…
A generating function is derived that counts the number of diagrams in an arbitrary scalar field theory. The number of graphs containing any number $n_j$ of $j$-point vertices is given. The count is also used to obtain the number of…
We give a specific cylinder functor for semifree dg categories. This allows us to construct a homotopy colimit functor explicitly. These two functors are "computable", specifically, the constructed cylinder functor sends a dg category of…
Classical set theory constructs the continuum via the power set P(N), thereby postulating an uncountable totality. However, constructive and computability-based approaches reveal that no formal system with countable syntax can generate all…
We introduce and discuss the notion of naturally full functor. The definition is similar to the definition of separable functor: a naturally full functor is a functorial version of a full functor, while a separable functor is a functorial…
Categories of partial functions have become increasingly important principally because of their applications in theoretical computer science. In this note we prove that the category of partial bijections between sets as an…
We develop some aspects of the theory of derivators, pointed derivators, and stable derivators. As a main result, we show that the values of a stable derivator can be canonically endowed with the structure of a triangulated category.…
We study the circumstances under which one can reconstruct a stack from its associated functor of isomorphism classes. This is possible surprisingly often: we show that many of the standard examples of moduli stacks are determined by their…
This paper is primarily intended as an introduction for the mathematically inclined to some of the rich algebraic combinatorics arising in for instance CFT. It is essentially self-contained, apart from some of the background motivation and…
This thesis presents a series of theoretical results and practical realisations about the theory of computation in distributive categories. Distributive categories have been proposed as a foundational tool for Computer Science in the last…