Adjoint functors, projectivization, and differentiation algorithms for representations of partially ordered sets. (Q441403)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Adjoint functors, projectivization, and differentiation algorithms for representations of partially ordered sets. |
scientific article; zbMATH DE number 6070516
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Adjoint functors, projectivization, and differentiation algorithms for representations of partially ordered sets. |
scientific article; zbMATH DE number 6070516 |
Statements
Adjoint functors, projectivization, and differentiation algorithms for representations of partially ordered sets. (English)
0 references
23 August 2012
0 references
Nazarova and Roiter's differentiation algorithm with respect to a maximal element in a poset and its counterpart concerning a minimal element are revisited. The differentiation is described by means of a principal ideal or a principal filter and viewed in relation to restriction and induction in group theory, and Auslander's concept of projectivization.
0 references
partially ordered sets
0 references
representations
0 references
differentiation algorithms
0 references
adjoint functors
0 references
projectivizations
0 references
induction functors
0 references
restriction functors
0 references
0 references
0.8847305
0 references
0 references
0 references
0.85137296
0 references
0.8505546
0 references
