Pavón's finiteness question and Ringel's brick-chain questions
Statement
Let be a finite-dimensional algebra and let be a finite-dimensional -module. A brick-chain filtration of is a filtration whose factors are filtered by copies of bricks , ordered so that whenever . The questions are: (1) whether has only finitely many brick-chain filtrations; (2) whether the number of such filtrations admits a universal bound in terms of the composition length , in particular whether it is at most ; and (3) for a torsion class , if denotes the largest submodule of belonging to , whether the set is finite.
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.