Pavón's finiteness question and Ringel's brick-chain questions
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.
References
Primary source
Additional references
Progress summary
A September 2026 preprint claims to settle both questions, but its conclusions have not yet been independently verified.
The problem asks whether brick-chain filtrations satisfy the finiteness properties posed by Pavón and Ringel, and how rapidly their possible lengths or types can grow.
Known results
Earlier work established that every module has a brick-chain filtration, while a related finiteness question was explicitly reported as open; special classes were known to have bounded complexity.
September 9, 2026 preprint
The preprint Finiteness and growth of brick chain filtrations claims finiteness, a bound, sharper bounds for -tilting-finite algebras, and examples with superfactorial growth, thereby claiming answers to Pavón’s and Ringel’s questions. It is unrefereed and remains unverified.
Current status (as of September 2026): An unrefereed preprint claims a complete resolution with quantitative bounds and growth examples, but independent verification is not recorded.
Solutions 0
No solutions have been posted yet.