Related papers: A Computable Functor From Graphs to Fields
We introduce infinite time computable model theory, the computable model theory arising with infinite time Turing machines, which provide infinitary notions of computability for structures built on the reals R. Much of the finite time…
We investigate the representation theory of finite sets. The correspondence functors are the functors from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. They have various…
We prove that there exists a countable family of continuous real functions whose graphs together with their inverses cover an uncountable square, i.e. a set of the form $X\times X$, where $X$ is an uncountable subset of the real line. This…
We show that the comma category $(\mathcal{F}\downarrow\mathbf{Grp})$ of groups under the free group functor $\mathcal{F}: \mathbf{Set} \to \mathbf{Grp}$ contains the category $\mathbf{Gph}$ of simple graphs as a full coreflective…
We provide requirements on effectively enumerable topological spaces which guarantee that the Rice-Shapiro theorem holds for the computable elements of these spaces. We show that the relaxation of these requirements leads to the classes of…
We generalize the construction of reflection functors from classical representation theory of quivers to arbitrary small categories with freely attached sinks or sources. These reflection morphisms are shown to induce equivalences between…
We present a method for constructing countable models of small theories and apply it to prove theorems on the maximal number of countable non-isomorphic models of linearly ordered theories.
The main result of this paper utilizes the representation graph of a group $G$, $R(V,G)$, and gives a general construction of a diagrammatic category $\mathbf{Dgrams}_{R(V,G)}$. The proof of the main theorem shows that, given explicit…
We prove that the notion of Drinfeld center defines a functor from the category of indecomposable multi-tensor categories with morphisms given by bimodules to that of braided tensor categories with morphisms given by monoidal bimodules.…
We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…
It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach…
These notes develop the foundations of Milnor-Witt K-theory for fields of arbitrary characteristic, without any perfectness assumptions. Extending the work of Morel and Feld, we establish all functorial properties of Milnor-Witt K-theory…
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…
A covariant functor from the category of the complex tori to the category of the Effros-Shen algebras is constructed. The functor maps isomorphic complex tori to the stably isomorphic Effros-Shen algebras. Our construction is based on the…
Let $\RR_S$ denote the expansion of the real ordered field by a family of real-valued functions $S$, where each function in $S$ is defined on a compact box and is a member of some quasianalytic class which is closed under the operations of…
Category theory is the language of homological algebra, allowing us to state broadly applicable theorems and results without needing to specify the details for every instance of analogous objects. However, authors often stray from the realm…
A subset $B \subset Y$ is constructible if it is an element of the smallest family that contains all open sets and is stable under finite intersections and complements. A function $f : X \to Y$ is said to be piece-wise closed if $X$ can be…
In fairly elementary terms this paper presents, and expands upon, a recent result by Garner by which the notion of topologicity of a concrete functor is subsumed under the concept of total cocompleteness of enriched category theory.…
In the context of infinity categories, we rethink the notion of derived functor in terms of correspondences. This is especially convenient for the description of a passage from an adjoint pair (F,G) of functors to a derived adjoint pair…
We present a detailed introduction of the theory of constructible sheaf complexes in the complex algebraic and analytic setting. All concepts are illustrated by many interesting examples and relevant applications, while some important…