Related papers: Functions out of Higher Truncations
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…
Given a bounding class $B$, we construct a bounded refinement $BK(-)$ of Quillen's $K$-theory functor from rings to spaces. $BK(-)$ is a functor from weighted rings to spaces, and is equipped with a comparison map $BK \to K$ induced by…
We collect and organise known results and add some new ones of the following nature: if A is a bounded operator in a Hilbert or Banach space, does there exist a nonconstant polynomial p(z) such that p(A) is "simpler", "nicer" than A. The…
Metatheorems about type theories are often proven by interpreting the syntax into models constructed using categorical gluing. We propose to use only sconing (gluing along a global section functor) instead of general gluing. The sconing is…
Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…
We fill a gap in the literature regarding `transport of structure' for (n+2)-angulated, n-exact, n-abelian and n-exangulated categories appearing in (classical and higher) homological algebra. As an application of our main results, we show…
We explain how the notion of homotopy colimits gives rise to that of mapping spaces, even in categories which are not simplicial. We apply the technique of model approximations and use elementary properties of the category of spaces to be…
Let $A_r=\{r<|z|<1\}$ be an annulus. We consider the class of operators $\mathcal{F}_r:=\{T\in\mathcal{B}(H): r^2T^{-1}(T^{-1})^*+TT^*\le r^2+1,\hspace{0.08 cm}\sigma(T)\subset A_r\}$ and show that for every bounded holomorphic function…
An algorithm to decide the emptiness of a regular type expression with set operators given a set of parameterised type definitions is presented. The algorithm can also be used to decide the equivalence of two regular type expressions and…
Given a homotopy equivalence f between two topological spaces we assemble well known pieces and unfold them into an explicit formula for a strong deformation retraction of the mapping cylinder of f onto its top.
In classical homotopy theory, two spaces are homotopy equivalent if one space can be continuously deformed into the other. This theory, however, does not respect the discrete nature of graphs. For this reason, a discrete homotopy theory…
Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…
We explain how higher homotopy operations, defined topologically, may be identified under mild assumptions with (the last of) the Dwyer-Kan-Smith cohomological obstructions to rectifying homotopy-commutative diagrams.
We establish, for $1 < p < \infty$, higher order $\mathcal{S}^p$-differentiability results of the function $\varphi : t\in \mathbb{R} \mapsto f(A+tK) - f(A)$ for selfadjoint operators $A$ and $K$ on a separable Hilbert space $\mathcal{H}$…
Consider a push-out diagram of spaces C <-- A --> B, construct the homotopy push-out, and then the homotopy pull-back of the diagram one gets by forgetting the initial object A. We compare the difference between A and this homotopy…
This expository note describes two convenient techniques in the context of homotopy type theory for proving and formalizing that a given map is an equivalence. The first technique decomposes the map as a series of basic equivalences, while…
The task of computing homomorphisms between two finite relational structures $\mathcal{A}$ and $\mathcal{B}$ is a well-studied question with numerous applications. Since the set $\operatorname{Hom}(\mathcal{A},\mathcal{B})$ of all…
Cover's function counting theorem is a milestone in the theory of artificial neural networks. It provides an answer to the fundamental question of determining how many binary assignments (dichotomies) of $p$ points in $n$ dimensions can be…
Agda's standard library struggles in various places with n-ary functions and relations. It introduces congruence and substitution operators for functions of arities one and two, and provides users with convenient combinators for…
We show that (for the weak operator topology) the set of unitary operators on a separable infinite-dimensional Hilbert space is residual in the set of all contractions. The analogous result holds for isometries and the strong operator…