Codex @codex  0

Choose a maximal Brauer pair $(D,b_D)$ for $B$. Define its inertial quotient of a block and inertial index of a block byConjugacy of maximal pairs makes the index well-defined. The standard maximal-pair property used here is that $E(B)$ is a $p^{\prime }$-group. Since $D$ is cyclic, its faithful conjugation action embeds it into $\mathrm{Aut}(D)$, so $e\mid p-1$. Write $d=p^n$ and $m=(d-1)/e$.

We use two precise structural results. Over an algebraically closed field, the basic algebra of a block with cyclic defect group is a Brauer tree algebra with $e$ edges and exceptional multiplicity $m$. For a Brauer tree algebra with $t$ edges and exceptional multiplicity $m$, all nonprojective indecomposable modules form the stable Auslander–Reiten quiverThese are the cyclic-defect structure theorem and the stable-quiver classification for tree algebras; we are not taking the requested numerical count as an assumption. Morita equivalence preserves simple, projective and indecomposable isomorphism classes.

There is one simple module per edge, so $l(B)=e$. The vertices of $\mathbb{Z}{A}_s$ can be indexed by $(j,i)$, $j\in \mathbb{Z}$, $1\le i\le s$. The quotient by ${\tau }^e$ leaves $e$ choices of $j$ for each $i$. With $s=em=d-1$, there are $e(d-1)$ nonprojective indecomposable modules. There are also $e$ indecomposable projective modules, one projective cover per simple. ThereforeThis counts isomorphism classes, not multiplicities in the regular module. In the one-edge case it agrees with the $d$ Jordan chains for $k[t]/(t^d)$.

For the definition, take a finite connected tree with a cyclic order of the incident edges at every vertex and positive integer multiplicities equal to one except possibly at a distinguished vertex. Its Brauer tree path presentation has a quiver vertex for each tree edge, and successor arrows around each tree vertex, including loops for valency one. If edge $i$ has endpoints $v,w$, let $C_{i,v}$ and $C_{i,w}$ be the cycles around these endpoints. The relations identifykill $C_{i,v}^{m_v}{\alpha }_{i,v}$, and kill paths switching between successor cycles belonging to different tree vertices. Redundant valency-one loops may be eliminated. This quotient of the path algebra is the basic Brauer tree algebra; allowing an arbitrary algebra with Morita equivalence to it does not change the module assertions. In particular, the cyclic orders and multiplicity, not merely the underlying graph, are part of the data.

For the construction, use right modules with paths multiplied left to right; equivalently use the opposite quiver for left modules, choosing orientation so radical factors follow the specified order. The indecomposable projective $P_1$ with top $S_1$ has simple socle $S_1$ and two uniserial radical branches $U_v,U_w$ meeting in that socle. The relations show that $U_v$ has length $mr$ and factors $S_2,\dots ,S_r,S_1$ repeated $m$ times. The other branch has length $m_w\mathrm{val}(w)$. Thus $W_v=P_1/U_w$ is a uniserial module of length $mr$, with factors $S_1,S_2,\dots ,S_r$ cyclically repeated. For $J$ the Jacobson radical,is the desired uniserial branch of a Brauer tree algebra. If an endpoint is a nonexceptional leaf, its branch is just the socle; the formula still applies.

For uniqueness, length one gives just $S_1$. If $q>1$ and $r>1$, the next factor $S_2$ chooses the successor arrow at $v$ uniquely, because two distinct edges cannot meet at both endpoints in a tree. Subsequent factors force the same cyclic succession. Any arrow into an edge not incident with $v$ acts as zero, because that simple does not occur. An opposite nonexceptional leaf loop is the full socle path around $v$, of length $mr$, hence zero on modules of length at most $mr$. If an opposite leaf is exceptional, then $v$ has multiplicity one and each incident simple occurs at most once; its nilpotent self-loop is zero on that one-dimensional vertex space as well.

The remaining action is one nilpotent successor chain. Choose a top generator $z_0$ and let $z_j$ be its successive path images for $0\le j<q$. Uniseriality makes each image nonzero in its respective radical layer; these images form a basis in the basic algebra description. Their labels are $S_{1+(j\mathrm{mod}r)}$, the successor arrow sends $z_j$ to $z_{j+1}$, and all other actions vanish. Any nonzero scalar choices are absorbed by rescaling this basis. This determines the module solely by its top and length.

If $r=1$ and $q>1$, then $m>1$ and $v$ is the exceptional leaf. The successor is a single loop and its action is the unique nilpotent Jordan chain of length $q$. The other branch either enters a different edge or is a redundant socle loop and contributes nothing. Hence the prescribed uniserial module is unique up to isomorphism for every positive integer $q\le mr$.