An Algorithmic Solution of a Birkhoff Type Problem

We give an algorithmic solution in a simple combinatorial data of Birkhoff s type problem studied in [14], for the category repft(I, K[t]/(tm)) of filtered I-chains of modules over the K-algebra K[t]/(tm), where m 2, I is a finite poset with a unique maximal element, and K is an algebraically closed field.

• Type: Journal
• Year: 2008
• Where: FUIN
• Authors: Daniel Simson, Mariusz Wojewódzki
• Keywords: Algorithmic Solution, FUIN 2008, Simple Combinatorial Data, Type Problem