WorksMathematics
Syzygy matrices and higher extensions over string algebras
Abstract
Over a finite-dimensional string algebra, higher extension dimensions may eventually vanish, become periodic, or grow without bound. We show how their behaviour can be read from a finite directed graph. Second syzygies split into uniserial modules from a finite family; their syzygies define a nonnegative integer matrix, so higher extension dimensions become weighted counts of walks. Only the part of the graph relevant to the chosen pair of modules contributes. This gives four growth regimes: eventual vanishing, periodicity, quasi-polynomial growth, and exponential growth. We derive the construction from projective covers, give explicit extension formulas over truncated cycles, and illustrate the growth regimes with examples.
Introduction
For gentle algebras, higher extensions have a rather simple long-term behaviour. Baur and Schroll showed that, over an algebraically closed field, the extension dimensions for any two finite-dimensional modules eventually either vanish or repeat periodically [BS21]. Their description also has a geometric interpretation on the surfaces associated with gentle algebras. Extensions of degree one had already been described rather explicitly, in terms of strings and their overlaps [2], and, for algebras from triangulations of unpunctured marked surfaces, in terms of crossings of curves [3]. It is natural to ask what remains of this picture for the larger class of string algebras.
The answer is not simply more complicated periodicity. Polynomial and exponential growth can occur, sometimes over very small quivers. For example, a radical-square-zero algebra with two loops at one vertex has , whereas two looped vertices joined by one arrow already give . We will see both examples below. What is perhaps less obvious is that the behaviour depends on the target as well as on the source: a projective resolution may grow, while its extension spaces with a particular module stay bounded or even vanish.
One reason to study these numbers is that they measure how a projective resolution grows. For , the number is exactly the number of indecomposable projectives in its -th term. A general target sees only part of this resolution. In Example 4.6, for instance, a single source gives the three sequences , , and , depending on the target. In the bounded derived category these are the dimensions of the morphism spaces from to the shifts . Thus even when the modules themselves have a concrete description, their higher extensions can have quite different sizes.
Computing the first few terms may suggest a pattern, but it does not say when that pattern begins, whether it persists, or which part of the algebra is responsible for it. A finite graph answers these questions without requiring us to construct an infinite resolution. It also separates two sources of growth that will recur in the examples: a syzygy can split repeatedly within one family, or it can keep sending new summands into another.
For string algebras, the work of Huisgen-Zimmermann and Huisgen-Zimmermann–Smalø provides the key observation: after two syzygies one meets only uniserial string modules, and there are finitely many possibilities [8 HZS05]. We take these modules as the states of a finite system. Their syzygies give a nonnegative integer matrix ; two vectors, one coming from and one from , then give
Thus the extension dimensions count walks in a directed graph. When the cyclic components are directed cycles, staying in one gives periodic behaviour and passing through several can give polynomial growth. Branching within a strongly connected component gives exponential growth. Only the part of the graph which connects the two vectors matters.
There is a related connection with automata in the representation theory of string algebras. Rees constructs finite automata whose accepted words describe strings [11]. In the graph used here, a step instead records a syzygy summand. The extension formula is a weighted-automaton calculation, in the sense of [BR11, §1.6].
The use of a syzygy quiver goes back to Cibils and was developed further by Howard, especially in the study of complexity and growth of projective resolutions [Cib93; How10; How15]. We recall the projective-cover calculation behind (1.A), give the growth alternatives, and then return to gentle algebras, truncated cycles, and linked cycles. This article presents partial results from the author’s already submitted dissertation [10], with the truncated-cycle computations written in a more general form. The surface interpretation is treated there.
Use of AI. OpenAI’s GPT-6 was used to improve the writing of this paper.
Preliminaries
Throughout, is a field, is a finite quiver and , where for some and is the arrow ideal. Paths are composed from left to right; all modules are finite-dimensional right modules. Write , , and . In particular, each vertex simple is one-dimensional over ; no assumption that is algebraically closed is needed.
A projective cover is a surjection from a projective whose kernel lies in its radical. Every module has a projective cover, unique up to isomorphism, and a decomposition into indecomposables, unique up to order and isomorphism. We use these facts in the form of [ARS95, I, Theorem 4.2, II, Theorem 2.2]. Write the cover sequence as
Iterating gives the minimal projective resolution of . The following facts explain how we will read extension dimensions from it.
Lemma 2.1 (Projective covers and extensions). For finite-dimensional -modules , the following hold.
Syzygies are additive: ; projective summands disappear. In particular, for P$ is projective.
For , dimension shift gives
Moreover,
Consequently,
If is a minimal projective resolution, then
Thus counts the indecomposable summands of , with multiplicity.
Proof. Direct sums of projective covers are projective covers [ARS95, I, Proposition 4.3]. Applying to the cover sequence gives dimension shift and the exact sequence
see also [ARS95, I, §5]. The cokernel and dimension formulas follow.
For the last assertion, minimality means that the image of each differential lies in the radical of the preceding projective. Every homomorphism from a projective to kills this radical. Hence the differentials vanish after applying . Here , so each indecomposable projective contributes one to the dimension. □
For string modules we follow the construction in [BR87, §3]. The classification over an arbitrary field is also given in [CB18, Theorems 1.1–1.2]. We recall the part of the construction needed for the cover calculations.
The syzygy matrix
Strings and projective arms
Write and for the source and target of an arrow . A string algebra has monomial relations, at most two arrows entering and at most two leaving each vertex, and at most one nonzero successor and one nonzero predecessor for each arrow. More explicitly, for each there is at most one composable with and at most one composable with . It is gentle if its relations are quadratic and each arrow also has at most one composable zero successor and one composable zero predecessor. Throughout this section, is a string algebra.
A basis path is a path with nonzero image in . A string is a composable word in arrows and formal inverses, without immediate cancellation or a subword belonging to or its inverse. Trivial strings are allowed. The module has one basis vector at each successive occurrence of a vertex in ; an arrow in the word acts between the corresponding vectors in its own direction. All other arrow actions are zero. Occurrences remain distinct even when their vertex labels agree, and .
A peak is a basis occurrence that survives in the top; a valley is one in the socle. The projective cover of a string module has one summand for each peak. A string with one peak is cyclic. A direct string gives a uniserial module , whose submodules are totally ordered. Every uniserial string module has a direct representative after reversing the word if necessary.
For each arrow from , there is a unique maximal basis path beginning with . Call it the -arm of . The path basis of consists of and the nontrivial prefixes of its at most two arms. Distinct arms have disjoint path bases, even if they visit the same quiver vertices.
Lemma 3.1 (the uniserial kernel). Let be a direct basis path starting at . The cover retains the initial segment specified by on its arm and kills every other arm. Its kernel is the direct sum of the remaining tails. In particular, is a sum of at most two uniserial string modules.
Proof. The cover sends to the top generator. The prefixes of map to the successive basis vectors of ; all other basis paths are killed. On each arm, the killed paths form a final segment, generated by its first path. Unique continuation makes this segment uniserial. The segments have disjoint path bases and together span the kernel. For a trivial , both arms are killed and the same argument applies. □
In Figure 1, filled dots survive in the quotient and open dots form the kernel. An exhausted arm contributes zero, not a trivial string; a one-vector tail contributes a simple. The kernel vanishes exactly when exhausts the sole arm (or is trivial at a sink).
Figure 1. A uniserial cover and its kernel tails.
Example 3.2 (why arrow ideals alone need not suffice). Consider the bound quiver
Figure 6.
The ideal has cover with path basis . Its kernel is the simple . Every arrow ideal has dimension two, so this kernel is not an arrow ideal. The uniserial state set must also contain simples.
Reduction after two syzygies
Set , and write for the non-projective part of a module . The reason a finite matrix suffices is a theorem of Huisgen-Zimmermann for monomial algebras. We use its following consequence for string algebras.
Proposition 3.3 (second-syzygy reduction). Every second syzygy is a direct sum of ideals , where is a positive-length basis path. In particular, it is a direct sum of uniserial string modules from a fixed finite family.
Proof. The monomial second-syzygy theorem [8 Theorem I], in the form [ZH92, Theorem A(1)], says that the syzygy of a submodule of a projective is a direct sum of principal ideals generated by positive-length paths. Apply it to , passing to the opposite algebra to obtain the right-module statement. The theorem holds over an arbitrary field.
For a string algebra, a positive-length path has at most one nonzero continuation at each step. The path basis of therefore forms a single chain, so is a uniserial string module. There are only finitely many basis paths. □
For a string module, we can see the first kernel directly in its cover. The description is that of [HZS05, Proposition 1(1)(a)]; the path-basis calculation below also works over an arbitrary field.
There is one projective for each peak of the string. Its basis paths follow the string until they reach an end or a valley; beyond that point they map to zero. At an interior valley, two paths , reach the same basis vector, so their difference belongs to the kernel. Their final arrows are distinct. An outgoing arrow can therefore extend at most one of them, and every nonzero extension of either path belongs to .
The kernel is consequently the direct sum of the unused endpoint tails and these valley modules. For a trivial string, the two possible arms are its endpoint tails. They exhaust the killed paths and the differences, and have disjoint supports in the path basis of the cover. Here, as in the string itself, repeated vertex labels still represent distinct basis occurrences. Each summand has one peak, so its own cover has only arm tails in its kernel. This gives the second-syzygy reduction for strings. A valley module need not itself be projective.
Example 3.4 (a valley kernel need not be projective). Consider the two bound quivers in Figure 2. In both, the cover of is , and the two paths into the valley give the kernel generator . In (a), all arrows kill , so
Figure 2. Valley kernels: (a) ; (b) .
In (b), , and the kernel is . The extra killed path is already part of the valley module. Both algebras are string but not gentle: has two zero predecessors.
The matrix and the two endpoint vectors
Let contain one representative of each isomorphism class of non-projective uniserial string modules. It is finite because there are only finitely many basis paths. Lemma 3.1 shows that taking syzygies and deleting projective summands stays within direct sums of this family.
For an indecomposable , write for its multiplicity in . Define
Rows index source modules; columns index their syzygy summands. We regard as column vectors. The matrix depends on , while the two vectors record the chosen pair.
Theorem 3.5 (the extension formula). Every row of has sum at most two. For all ,
Proof. Lemma 3.1 gives the row bound. By Proposition 3.3, records all non-projective summands after two syzygies. Syzygy is additive and kills projective summands, so one further step multiplies the multiplicity row by . Induction gives for . Now apply dimension shift and additivity from Lemma 2.1.
The exponent begins at zero in degree three. The first two positive degrees require their own cover calculations. For , use the cokernel or the dimension formula in Lemma 2.1; maps that extend to the cover do not contribute.
Example 3.6 (a complete calculation). Let , and . The two covers give and . In the order ,
Take and . Then , so . Every map kills ; both restriction maps in {(2.A)} are zero. Since and each have dimension one, . Hence
The same covers give 3 in degrees one and two. Degree zero is 4: the projective summand contributes to Hom, but not to positive Ext.
Once is known, a new pair of modules requires only the two vectors and . For gentle string pairs over an algebraically closed field, the arrow and overlap basis of [2 Theorem A] is another way to compute .
Corollary 3.7 (rational series). The truncated Poincaré series, regarded as a formal power series over , is
It is rational, with denominator dividing . The higher extension dimensions satisfy a linear recurrence.
Proof. Sum the matrix powers as a formal geometric series and use the adjugate formula. A recurrence follows by applying the characteristic polynomial of to its powers. □
The denominator can be smaller for a particular pair. In Example 3.6, , but the truncated series is . The syzygies alternate while the target gives both states the same weight. The constant tail 3 needs only a one-state matrix description, . In general, linear minimization over can reduce the number of states further [BR11, §2.3], though the resulting states need not represent modules or have nonnegative integral transition weights.
Growth from the syzygy graph
View a nonnegative integer matrix as the adjacency matrix of a directed multigraph, with edges from to . Thus counts walks of length , and
counts them with initial and terminal weights. This is a weighted automaton over with one letter: each reading of that letter applies , and the word of length has weight . We use the same walk-counting methods that appear in the growth theory of regular languages [Gaw+10].
A vertex is accessible if it can be reached from , and coaccessible if it can reach . We keep only vertices with both properties. Borrowing the terminology of automata theory [13], we call the resulting graph the trimmed graph for , or the trimmed syzygy graph for when and . Restricting to it does not change .
We use the usual strongly connected components. A component is cyclic if it contains a cycle, and it is a directed cycle when its internal edges, counted with multiplicity, form a single cycle (possibly a loop). The component graph is acyclic.
The four alternatives
A sequence is eventually quasi-polynomial of degree if, on each residue class modulo some , its sufficiently large terms agree with a polynomial of degree at most , and the degree is exactly on at least one class. Degree zero means eventual periodicity with a nonzero tail.
Lemma 4.1. Let be the adjacency matrix of a cyclic strongly connected directed multigraph. Then , with equality precisely when the graph is a directed cycle.
Proof. Every row sum is at least one. If is a left Perron eigenvector, then , with strict inequality whenever a row sum exceeds one. Thus , with equality only when every row sum is one. Strong connectivity then gives a directed cycle [14 Chapter 1].
Theorem 4.2 (growth alternatives). Let for a nonnegative integer matrix and nonnegative integer vectors . Exactly one of the following holds.
The trimmed graph is acyclic. Then is eventually zero.
The trimmed graph contains a cycle, every cyclic component is a directed cycle, and no walk meets two cyclic components. Then is eventually periodic and not eventually zero.
Every cyclic component is a directed cycle, and the greatest number met by a walk is . Then is eventually quasi-polynomial of degree .
Some cyclic component of the trimmed graph has spectral radius greater than one. If is the largest such radius, then
In (2) and (3), the least common multiple of the cycle lengths is a quasiperiod. The same conclusions hold for higher extension dimensions, with the index shift in Theorem 3.5.
Proof. An acyclic graph has bounded walk length. Every cycle in the trimmed graph lies on a walk from the initial to the terminal support, so it gives arbitrarily long counted walks. Suppose now that all cyclic components are directed cycles. Fix the route through the component graph, its connecting edges, and its initial and terminal support vertices. In each cycle, a walk follows the unique path from entry to exit of length less than one circuit, with any number of complete circuits inserted. There are finitely many such routes , and each contributes
to , where is the number of cycles on the route. Routes without cycles contribute a polynomial.
Let be the least common multiple of the cycle lengths. All poles of the series are -th roots of unity, so its coefficients are eventually quasi-polynomial with quasiperiod [15 Proposition 4.4.1]. To find the degree, put . The pole at has order exactly , since the positive route contributions cannot cancel there, and no other pole has larger order. In a partial fraction expansion, a pole of order contributes a polynomial of degree times an -periodic sequence. The degree is therefore . The cases and give (2) and (3).
Finally, let be the adjacency matrix of a cyclic component of maximal radius . The trimmed matrix is block triangular with the component matrices on its diagonal, so its spectral radius is . The spectral-radius formula for matrix powers gives .
For the reverse inequality, fix entry and exit walks through a vertex of . They give for some and . If is the period of , the block of containing is primitive and has spectral radius . Perron–Frobenius theory therefore gives , with . This subsequence proves the reverse inequality and hence (4); Lemma 4.1 exhausts the possibilities.
The row bound gives for , so an exponential rate is at most two. Trimming matters: the full matrix may grow faster than the coefficient for a chosen pair. Even in the exponential case some residue classes can vanish.
Remark 4.3 (finer asymptotics). A limit need not exist: residue classes may vanish or have different rates. Finer asymptotics follow from periodic-class decomposition and Perron–Frobenius theory [12, 14]. For example, and give and . Thus , although every odd term vanishes.
Small examples of the four behaviours
For the following examples we impose all paths of length two as relations. Their extensions can be computed directly from the quiver.
Lemma 4.4 (Radical-square-zero simples). For , let be the number of arrows from to . Then
Proof. The radical of is the direct sum of the simples at the targets of arrows from . Iterate and apply Lemma 2.1. □
In Figure 3, each vertex has at most two incoming and two outgoing arrows, so these radical-square-zero algebras are string. A walk records successive syzygies; it need not survive as a nonzero path in .
Figure 3. Four growth behaviours for .
Example 4.5 (vanishing and periodicity). In Figure 3a, the only nonzero extension between and occurs in degree two, where it has dimension one. Although the length-two path is zero in , it still counts as a walk. In (b),
Example 4.6 (one or two transfers). In Figure 3c, a walk from 0 to 1 chooses one of its steps at which to cross the connecting arrow. A walk from 0 to 2 chooses two crossing steps. Thus
The last two series are and , respectively. The source is the same in all three cases; changing the target changes the growth.
Example 4.7 (Fibonacci growth). In Figure 3(d), the adjacency matrix is
The walk counts satisfy and for . Thus is , with generating function and exponential rate . Here branching occurs within one recurrent component.
Example 4.8 (two loops). For the bound quiver
,
each step of a walk has two choices. Thus has . The full non-projective uniserial string family is , with matrix
The projective has radical ; the covers of and each have simple kernel. Only is recurrent; the two other states feed into it after one step. Quadratic relations alone therefore allow exponential growth.
Periodic examples
The gentle case
Write for an arrow ideal. In the small gentle quiver below, the dotted curve marks the relation :

Figure 1 (PDF p. 9).
The gentle conditions simplify both parts of the kernel calculation. Quadraticity also makes every positive-length path ideal isomorphic to an arrow ideal. Together with Proposition 3.3, this gives periodicity over an arbitrary field.
Lemma 5.1 (gentle kernels). For a gentle algebra, is if for an arrow starting at , and is zero if no such arrow exists. For a string module,
where is projective and each is zero or an arrow ideal.
Proof. The cover sends to . A basis path is killed precisely when it begins with an arrow such that : quadraticity excludes a first obstruction farther along the path. There is at most one such , so the kernel is or zero.
For the second assertion, use the string-kernel description following Proposition 3.3. At a valley , the final arrows of are distinct. Each outgoing arrow has exactly one nonzero predecessor among them, by the two gentle predecessor conditions. Quadraticity implies that every positive-length basis path from extends exactly one of . Distinct paths have disjoint images in the path basis of the cover, so , , is injective as well as surjective.
For any positive-length basis path , quadraticity gives if and only if for every basis path starting at . Thus defines an isomorphism . In particular, each endpoint tail is an arrow ideal up to isomorphism. This gives the decomposition of [BS21, Proposition 3.1]. □
Corollary 5.2 (gentle periodicity). Higher extension dimensions over a gentle algebra over any field are eventually periodic, including the possibility of eventual zero.
Proof. By Proposition 3.3 and the path-ideal isomorphism just proved, is a direct sum of arrow ideals. The first part of Lemma 5.1 sends each arrow ideal to another arrow ideal or to zero. There are finitely many arrows, so each such sequence terminates or becomes periodic. Taking a common period for the finitely many summands makes the higher syzygies of periodic. Dimension shift gives eventual periodicity of for every target . □
Over an algebraically closed field this recovers the vanishing-or-periodicity conclusion of [BS21, Theorem 3.4], which also gives a finer endpoint criterion for a nonzero periodic tail. In that setting, bands satisfy a stronger conclusion: their projective and injective dimensions are at most one. This is [BS21, Corollary 3.6] for quasi-simple bands; a filtration by quasi-simple bands and the long exact sequences for Ext give the same bounds in higher rank. For the radical-square-zero cycle one sees the period directly: and
Brackets denote the indicator of the enclosed condition.
Truncated cycles
Let
where has arrows , with indices modulo . Let be the uniserial module with top and length , for . Its successive composition factors are , and . We allow , so vertex labels can repeat in a composition series. The cover calculation is unchanged; the Hom calculation must count each eligible occurrence separately.
Proposition 5.3 (complementary tails). For ,
The least syzygy period of is
The least positive even return time is always . The stable syzygy matrix is a permutation matrix.
Proof. The kernel of is its complementary tail, of length and top . Applying this twice restores the length and advances the top by . If , odd returns are impossible because they change the length. Even returns advance the top by a multiple of , giving period . If , every syzygy preserves length and advances the top by , so the least period is . Finally the map is a permutation of the finite state set. □
Example 5.4 (even and odd periods). For , the orbit of begins
Its length is ten: every second step advances the top by three, and an odd return cannot restore the length. For , the module instead has period three:
Its least positive even return time is six.
Maps and extensions from eligible depths
A map between two uniserial modules is determined by the image of a top generator. In the target, the allowed path-basis vectors give a basis of maps. We number their depths from zero at the top. The vertex label gives a congruence, and the annihilation condition gives an interval of allowed depths. To compute Ext, we remove the maps that extend to the preceding projective in the resolution.
Theorem 5.5 (extensions over a truncated cycle). Let and , where and . Write ; explicitly,
For every ,
For arbitrary , degree zero is given by
For a projective source, positive-degree extensions vanish.
Proof. Let be the usual path-basis vectors of , with at depth and vertex . A homomorphism from is determined by the image of its top generator. Such an image must lie at vertex , and it must be annihilated by the path of length . Thus a basis for the possible images is given by
These vectors give independent homomorphisms, even when the same vertex occurs several times in . Taking and proves the Hom formula.
To calculate extensions, put . The embedding of into the preceding projective begins at depth . A map from that projective is determined by an arbitrary vector of at vertex . On a basis vector , restriction multiplies by the path of length , giving if , and zero otherwise. Thus the image of restriction is spanned by exactly the eligible basis maps with . Conversely, each such map lifts by sending the projective’s top generator to . The cokernel in (2.A) therefore retains precisely the eligible depths . Combining this with the annihilation bound and applying dimension shift gives the formula. □
The dimensions can exceed one: over ,
Here , whose generator can map to either circled occurrence in the target:
Both maps survive in Ext: the preceding projective contains the syzygy at depth three, so its restriction to this length-three target is zero.
Every positive-degree sequence has period dividing , but its least period can be shorter than the source’s syzygy period. We now determine the least periods for the arrow-ideal pairs considered in this dissertation.
Least periods for arrow ideals
Corollary 5.6 (arrow-ideal dimensions and least periods). Assume and , and write . Put . For ,
Let . If , the least period is . If and is congruent to or modulo , the least period is . Otherwise all positive-degree terms are zero. In degree zero,
Proof. Proposition 5.3 gives
Substituting into Theorem 5.5 leaves one possible depth on each parity and gives the displayed congruence. The even degrees attain exactly the class modulo , and the odd degrees attain class $1.
On each active parity, the indicator has least period in the half-degree. Hence the smallest even period is . An odd period would require both parities to be active. Shifting a nonzero even term by this period changes by ; shifting a nonzero odd term changes it by . Since both shifted terms must still be nonzero, we obtain
Subtracting forces , hence under . In that case . The Hom formula follows from the same theorem in degree zero.
Example 5.7 (reading the congruence). Over , the self-pair has nonzero positive extensions exactly in degrees and modulo ten. The pair has them in degrees and modulo ten:
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | |
| 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | |
| 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
Table 1.
For , . The pair has no positive extensions because is neither nor modulo . The source still has periodic syzygies: the target detects none of the relevant first extensions.
For these algebras are not gentle, but their one-arm covers still force periodic syzygies. For split Nakayama algebras, Erdmann, Klász and Marczinzik show that a nonzero self-extension in degree one of an indecomposable module forces nonzero self-extensions in every positive degree [4]. In the restricted range of Corollary 5.6, . Outside that range, take and . Here , and Theorem 5.5 gives for every , in agreement with the cited result.
Polynomial growth from linked cycles
The growth mechanism is already visible in a radical-square-zero algebra. Take the quiver
Figure 7.
The loops keep the simples where they are, while the arrow produces a new summand:
Hence , and for ,
This is a two-vertex version of Example 4.6. The same mechanism works when the persistent summands are longer uniserial modules rather than simples.
Two cycles
Let be an oriented cycle with vertex set . We take two copies, with vertices and and arrows
All indices are modulo ; Figure 4 shows the complete quiver for .
Figure 4. Two linked 3-cycles; the dotted arcs mark .
Kill all paths of length along the upper cycle and of length along the lower cycle, where . In addition impose, for every ,
We denote the resulting string algebra by . The mixed relations ensure that .
Write for the uniserial module of length with top , supported on the upper cycle, and for its lower counterpart, with . All links act as zero. The upper projective cover has an extra arm , so
Retaining only the complementary tail permutes the modules on each row. On this family the syzygy matrix therefore has the form
where are permutation matrices and records the link simples. The orbits of and are the recurrent components of the syzygy graph. The summation counts the possible times of transfer from an upper orbit to a lower one.
After two syzygies these are all the modules we need. By Proposition 3.3, the summands are positive-length path ideals: a path along either cycle leaves a tail shorter than its truncation length, and a link gives a lower simple.
A walk meets at most two orbits, one on each row. By Theorem 4.2, every extension sequence is eventually zero or eventually quasi-polynomial of degree at most one. If all summands of lie on the lower cycle, the sequence is bounded. A linear term occurs on some residue class precisely when an upper state in can reach a lower state in .
Example 6.1 (one new summand at every step). Take . The first syzygies of the upper simple are
At each step the upper summand produces one new lower simple, while each existing lower summand has just one successor. Hence has indecomposable summands, all with simple top. Taking , Lemma 2.1 gives
Several cycles and accessible links
Take finitely many disjoint oriented cycles , with vertices, and kill their paths of length , where . Join them by arrows, called links, pointing forward in some ordering of the cycles. Each vertex may be the source of at most one link and the target of at most one link. Kill every length-two path containing a link. The resulting algebra is string, and each link gives .
Write for the uniserial module of length with top on , with all links acting as zero. Its cover gives
All summands are non-projective. Retaining the summand on gives the permutation
with vertex indices modulo . Starting from , its successive tops are
Thus, if , the source of a link occurs exactly when
Every such top recurs periodically. Using that link starts a new persistent summand at its target vertex on the next cycle. Call a chain of links live from if (6.B) holds successively, beginning at and then at each preceding link target. Let be the largest number of links in such a chain, with value zero if none can be used.
Proposition 6.2 (the degree from a live chain). Let count the indecomposable summands of , with multiplicity. Then is eventually quasi-polynomial of degree .
Proof. By (6.A), syzygies stay within direct sums of the finitely many modules . Since links point forward, the recurrent components of the syzygy graph on these modules are exactly the orbits of the permutations . A transfer between reachable orbits uses a live link and enters the next orbit at a simple. The greatest number of orbits met by a walk starting at is therefore . Apply Theorem 4.2 with terminal weight 1.
For a pair , start instead at the summands of . From , the first link is accessible when its source is congruent to or modulo ; all subsequent transfers start from simples and use (6.B). Finally discard states unable to reach . The last restriction can lower the degree: a target need not detect every summand.
Example 6.3 (a live link and a missed link). Use the quivers in Figure 5, killing all paths of length three along a cycle and all paths of length two containing a link. Starting at , the first link produces . Following only the summand that stays on the middle cycle gives
Figure 5. Growth from : (a) quadratic; (b) linear.
The tops are and . The second link in (a) is therefore used repeatedly, while the link in (b), starting at , is never used. Although also has a composition factor at , only its top produces a link summand in (6.A). The two summand counts therefore have degrees two and one, respectively.
The first few counts make the difference visible:
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | |
| second link at | 1 | 2 | 3 | 4 | 6 | 7 | 10 | 11 | 15 |
| second link at | 1 | 2 | 2 | 3 | 3 | 4 | 4 | 5 | 5 |
For the first row, in degree the three cycles contribute , , and summands. In degree , the middle count increases to and the other two stay the same. In the second row, the third cycle contributes nothing and the second contributes in degree . These numbers also give .
Acknowledgements
I thank Azzurra Ciliberti and Karin Baur for their guidance and supervision during my dissertation.
Rühr-Universität Bochum
Email address: [email protected]
References
- [2]İlke Çanakçı, David Pauksztello, and Sibylle Schroll. “On extensions for gentle algebras”. In: Canad. J. Math. 73.1 (2021), pp. 249–292. doi: 10.4153/S0008414X2000005X.DOI
- [3]İlke Çanakçı and Sibylle Schroll. “Extensions in Jacobian algebras and cluster categories of marked surfaces”. In: Adv. Math. 313 (2017), pp. 1–49. doi: 10.1016/j.aim.2017.03.016.DOI
- [4]Karin Erdmann, Viktória Klász, and René Marczinzik. “Selfextensions of modules over group algebras”. In: J. Algebra 649 (2024). With an appendix by Bernhard Böhmler and René Marczinzik, pp. 319–346. doi: 10.1016/j.jalgebra.2024.03.014.DOI
- [8]Birge Huisgen-Zimmermann. “Predicting syzygies over monomial relations algebras”. In: Manuscripta Math. 70 (1991), pp. 157–182. doi: 10.1007/BF02568368.DOI
- [10]Martin Irungu. “Higher Syzygies and Ext-Periodicity over String Algebras”. Submitted dissertation. Dissertation. Ruhr-Universität Bochum, Sept. 2026.
- [11]Sarah Rees. “The Automata that Define Representations of Monomial Algebras”. In: Algebras and Representation Theory 11.3 (2008), pp. 207–214. doi: 10.1007/s10468-007-9063-4.DOI
- [12]Uriel G. Rothblum. “Algebraic eigenspaces of nonnegative matrices”. In: Linear Algebra Appl. 12.3 (1975), pp. 281–292. DOI: 10.1016/0024-3795(75)90050-6.DOI
- [13]Jacques Sakarovitch. Elements of Automata Theory. Cambridge University Press, 2009. DOI: 10.1017/CBO9781139195218.DOI
- [14]Eugene Seneta. Non-negative Matrices and Markov Chains. Second. New York: Springer, 1981.
- [15]Richard P. Stanley. Enumerative Combinatorics. Second. Vol. 1. Cambridge Studies in Advanced Mathematics. Cambridge University Press, 2012. DOI: 10.1017/CBO9781139058520.DOI





