نتایج جستجو برای: functor

تعداد نتایج: 3392  

Journal: :Inf. Comput. 2010
Daniel Schwencke

Covarieties of coalgebras are those classes of coalgebras for an endofunctor H on the category of sets that are closed under coproducts, subcoalgebras and quotients. Equivalently, covarieties are classes of H-coalgebras that can be presented by coequations. Adámek introduced a logic of coequations and proved soundness and completeness for all polynomial functors on the category of sets. Here th...

Journal: :International Mathematics Research Notices 2021

Abstract We prove that for any $\mathbb{P}^n$-functor all the convolutions (double cones) of three-term complex $FHR \xrightarrow{\psi } FR \xrightarrow{{\operatorname{{\epsilon }}}} {\operatorname{Id}}$ defining its $\mathbb{P}$-twist are isomorphic. also introduce a new notion non-split $\mathbb{P}^n$-functor.

2008
TOMASZ BRZEZIŃSKI J. GÓMEZ-TORRECILLAS

To a B-coring and a (B, A)-bimodule that is finitely generated and projective as a right A-module an A-coring is associated. This new coring is termed a base ring extension of a coring by a module. We study how the properties of a bimodule such as separability and the Frobenius properties are reflected in the induced base ring extension coring. Any bimodule that is finitely generated and projec...

2015
Serge Bouc Radu Stancu

This is a report on some recent joint work with Radu Stancu, to appear in [4]. It is an expanded version of a talk given at the RIMS workshop Cohomology of finite groups and related topics, February 18-20, 2015. 1. Cohomological Mackey functors 1.1. Let G be a finite group, and k be a commutative ring. There are many equivalent definitions of Mackey functors for G over k. For the “naive” one, t...

1996
Martín Abadi Marcelo P. Fiore

We study recursive types from a syntactic perspective. In particular, we compare the formulations of recurs-ive types that are used in programming languages and formal systems. Our main tool is a new syntactic explanation of type expressions as functors. We also introduce a simple logic for programs with recursive types in which we carry out our proofs.

1995
Michael P. Fourman Hayo Thielecke

We present a simple categorical semantics for ML signatures, structures and functors. Our approach relies on realizablity semantics in the category of assemblies. Signatures and structures are modelled as objects in slices of the category of assemblies. Instantiation of signatures to structures and hence functor application is modelled by pullback.

2005
Volodymyr Mazorchuk

We use Arkhipov’s twisting functors to show that the universal enveloping algebra of a semi-simple complex finite-dimensional Lie algebra surjects onto the space of ad-finite endomorphisms of the simple highest weight module L(λ), whose highest weight is associated (in the natural way) with a subset of simple roots and a simple root in this subset. This is a new step towards a complete answer t...

Journal: :Electr. Notes Theor. Comput. Sci. 2004
Philippe Gaucher

In this talk, I will explain the importance of the homotopy branching space functor (and of the homotopy merging space functor) in dihomotopy theory.

2009
L. Balduzzi C. Carmeli R. Fioresi

We study the local functor of points (which we call the Weil– Berezin functor) for smooth supermanifolds, providing a characterization, representability theorems and applications to differential calculus.

Journal: :Advances in Mathematics 2018

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید