ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let AA be a finite-dimensional algebra and let MM be a finite-dimensional AA-module. A brick-chain filtration of MM is a filtration whose factors are filtered by copies of bricks B1,…,BrB_1,\ldots,B_r, ordered so that Hom⁡A(Bi,Bj)=0\operatorname{Hom}_A(B_i,B_j)=0 whenever i<ji<j. The questions are: (1) whether MM has only finitely many brick-chain filtrations; (2) whether the number of such filtrations admits a universal bound in terms of the composition length d=ℓA(M)d=\ell_A(M), in particular whether it is at most d!d!; and (3) for a torsion class T\mathcal{T}, if tT(M)t_{\mathcal{T}}(M) denotes the largest submodule of MM belonging to T\mathcal{T}, whether the set {tT(M):T is a torsion class of A}\{t_{\mathcal{T}}(M):\mathcal{T}\text{ is a torsion class of }A\} is finite.

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.