English
Related papers

Related papers: On Adjoint and Brain Functors

200 papers

The well-known difficulties arising in a classification which is not set-theoretically trivial---involving what is sometimes called a non-smooth quotient---have been overcome in a striking way in the theory of operator algebras by the use…

Operator Algebras · Mathematics 2007-11-21 George A. Elliott

Given a locally presentable enriched category $\mathcal{E}$ together with a small dense full subcategory $\mathcal A$ of arities, we study the relationship between monads on $\mathcal E$ and identity-on-objects functors out of $\mathcal A$,…

Category Theory · Mathematics 2020-06-03 John Bourke , Richard Garner

We construct generalized multicategories associated to an arbitrary operad in Cat that is $\Sigma$-free. The construction generalizes the passage to symmetric multicategories from permutative categories, which is the case when the operad is…

Category Theory · Mathematics 2015-02-18 A. D. Elmendorf

A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…

Combinatorics · Mathematics 2026-03-12 Juliann Geraci , Alexander B. Kunin , Alexandra Seceleanu

Category theory unifies mathematical concepts, aiding comparisons across structures by incorporating objects and morphisms, which capture their interactions. It has influenced areas of computer science such as automata theory, functional…

Category Theory · Mathematics 2024-02-09 Nima Rasekh , Niels van der Weide , Benedikt Ahrens , Paige Randall North

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…

Category Theory · Mathematics 2008-02-06 Claudio Pisani

We give a new criterion guaranteeing existence of model structures left-induced along a functor admitting both adjoints. This works under the hypothesis that the functor induces idempotent adjunctions at the homotopy category level. As an…

Category Theory · Mathematics 2022-10-25 Philip Hackney , Martina Rovelli

In a previous paper we introduced the concept of semiseparable functor. Here we continue our study of these functors in connection with idempotent (Cauchy) completion. To this aim, we introduce and investigate the notions of (co)reflection…

Category Theory · Mathematics 2023-06-13 Alessandro Ardizzoni , Lucrezia Bottegoni

Morphisms between (formal) contexts are certain pairs of maps, one between objects and one between attributes of the contexts in question. We study several classes of such morphisms and the connections between them. Among other things, we…

Category Theory · Mathematics 2014-07-03 Marcel Erné

Functionals (i.e. functions of functions) are widely used in quantum field theory and solid-state physics. In this paper, functionals are given a rigorous mathematical framework and their main properties are described. The choice of the…

Mathematical Physics · Physics 2018-03-14 Christian Brouder , Nguyen Viet Dang , Camille Laurent-Gengoux , Kasia Rejzner

This article aims to provide a novel formalization of the concept of computational irreducibility in terms of the exactness of functorial correspondence between a category of data structures and elementary computations and a corresponding…

Computational Complexity · Computer Science 2023-01-13 Jonathan Gorard

Let X_1 and X_2 be schemes of finite type over a field of characteristic 0. Let Q be an object in the category D-mod(X_1\times X_2) and consider the functor F:D-mod(X_1)->Dmod(X_2) defined by Q. Assume that F admits a right adjoint also…

Algebraic Geometry · Mathematics 2015-11-25 Dennis Gaitsgory

This note presents a method of interpreting the tree adjoining languages as the natural third step in a hierarchy that starts with the regular and the context-free languages. The central notion in this account is that of a higher-order…

cmp-lg · Computer Science 2008-02-03 Uwe Moennich

We construct a functor from the category of graphs to the category of groups which is faithful and "almost" full, in the sense that it induces bijections of the Hom sets up to trivial homomorphisms and conjugation in the category of groups.…

Group Theory · Mathematics 2010-05-19 Adam J. Przezdziecki

Consider a coring with exact rational functor, and a finitely generated and projective right comodule. We construct a functor (\emph{coinduction functor}) which is right adjoint to the hom-functor represented by this comodule. Using the…

Rings and Algebras · Mathematics 2009-02-13 L. El Kaoutit , J. Gómez-Torrecillas

Based on Gandy's principles for models of computation we give category-theoretic axioms describing locally deterministic updates to finite objects. Rather than fixing a particular category of states, we describe what properties such a…

Discrete Mathematics · Computer Science 2019-04-24 Joseph Razavi , Andrea Schalk

The recent trend in mathematics is towards a framework of abstract mathematical objects, rather than the more concrete approach of explicitly defining elements which objects were thought to consist of. A natural question to raise is whether…

Logic · Mathematics 2013-12-24 Benjamin Horowitz

Several proposals to deal with the dynamics of general relativity involve gauge fixings or the introduction matter fields in terms of which the theory is deparameterized. The resulting theories have true Hamiltonians for their evolution…

General Relativity and Quantum Cosmology · Physics 2013-05-30 Rodolfo Gambini , Jorge Pullin

We introduce a natural method of computing antiderivatives of a large class of functions which stems from the observation that the series expansion of an antiderivative differs from the series expansion of the corresponding integrand by…

Classical Analysis and ODEs · Mathematics 2018-08-16 Petr Blaschke

We revisit once again the connection between three notions of computation: monads, arrows and idioms (also called applicative functors). We employ monoidal categories of finitary functors and profunctors on finite sets as models of these…

Programming Languages · Computer Science 2018-07-12 Exequiel Rivas