Adjoint Functors, Projectivization, and Differentiation Algorithms for Representations of Partially Ordered Sets

Details Adjoint Functors, Projectivization, and Differentiation Algorithms for Representations of Partially Ordered Sets Adjoint Functors, Projectivization, and Differentiation Algorithms for Representations of Partially Ordered Sets

2011-09-19

arxiv.org/abs/1109.4157v2

Mathematics

Representation Theory

Revised version, accepted for publication by the Journal of Algebra

Scientific paper

Adjoint functors and projectivization in representation theory of partially
ordered sets are used to generalize the algorithms of differentiation by a
maximal and by a minimal point. Conceptual explanations are given for the
combinatorial construction of the derived set and for the differentiation
functor

Affiliated with

Also associated with

No associations

Rating

Adjoint Functors, Projectivization, and Differentiation Algorithms for Representations of Partially Ordered Sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Adjoint Functors, Projectivization, and Differentiation Algorithms for Representations of Partially Ordered Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adjoint Functors, Projectivization, and Differentiation Algorithms for Representations of Partially Ordered Sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-145662