Auslander-Gorenstein Monomial Algebras
- Auslander-Gorenstein monomial algebras are finite-dimensional algebras defined by minimal injective coresolutions satisfying Auslander’s n-Gorenstein inequalities and finite injective dimension.
- Their structure is governed by combinatorial restrictions on quivers and relations that enforce string algebra behavior and enable classification via perfect path techniques.
- They refine Iwanaga-Gorenstein algebras by connecting homological invariants with combinatorial reductions to gentle and Nakayama algebras, impacting studies in Calabi–Yau tilting.
Auslander-Gorenstein monomial algebras are finite-dimensional monomial algebras for which the minimal injective coresolution of the regular module satisfies Auslander’s -Gorenstein inequalities in all degrees and has finite injective dimension. In the finite-dimensional setting, they form a homological refinement of Iwanaga-Gorenstein algebras, but in the monomial case the condition is also markedly combinatorial: it constrains the quiver and relations, forces string-algebra behavior, is detected by a bijective Auslander-Reiten map, and in the acyclic Auslander regular case can be read from a Bruhat factorization of the Coxeter matrix (Klász, 9 Aug 2025, Klász et al., 26 Aug 2025, Klász et al., 2 Apr 2026).
1. Homological framework and finite-dimensional criteria
For a finite-dimensional algebra , one fixes a minimal injective coresolution
The algebra is -Gorenstein if
It is Auslander-Gorenstein if it is -Gorenstein for all and . It is Auslander regular if it is Auslander-Gorenstein and has finite global dimension. In parallel, 0 is Iwanaga-Gorenstein if
1
For finite-dimensional algebras, Auslander’s left-right symmetry implies
2
so Auslander-Gorenstein is left-right symmetric as well (Klász et al., 26 Aug 2025, Klász, 9 Aug 2025).
A standard numerical invariant is the grade
3
For an Iwanaga-Gorenstein algebra 4, a central criterion says that 5 is Auslander-Gorenstein if and only if for every indecomposable injective 6-module 7,
8
The survey literature also records several equivalent Ext-theoretic formulations, and emphasizes that the Auslander-Reiten permutation on simples coincides with Iyama’s grade permutation for Auslander-Gorenstein algebras (Klász et al., 26 Aug 2025).
In the monomial setting, the decisive homological characterization is given by the Auslander-Reiten map. If every indecomposable injective 9 has a finite minimal projective resolution whose last non-zero term is indecomposable, then
0
is well-defined. For monomial algebras,
1
This confirms a conjecture of Marczinzik for monomial algebras and provides a genuinely homological characterization inside a class usually governed by quiver combinatorics (Klász, 9 Aug 2025, Klász et al., 26 Aug 2025).
2. Gorenstein-projective modules and the perfect-path mechanism
The combinatorial control of monomial homological algebra begins with the bound-quiver presentation
2
where 3 is finite and 4 is an admissible monomial ideal generated by paths of length at least two. Writing 5 for the finite set of minimal paths generating 6, a path is nonzero in 7 precisely when it contains no subpath from 8. These nonzero paths form a 9-basis of 0. For any nonzero path 1, the cyclic module 2 is the basic object in the theory (Chen et al., 2015).
The key combinatorial notion is that of a perfect pair 3 of nonzero paths. Such a pair is composable, satisfies 4 in 5, and realizes 6 and 7 as the unique minimal annihilators of one another. A path 8 is perfect if it lies in a cycle of perfect pairs
9
The central classification theorem states that there is a bijection
0
sending a perfect path 1 to the module 2. Thus every indecomposable non-projective Gorenstein-projective module over a monomial algebra is isomorphic to 3 for a unique perfect path 4, and every perfect path yields such a module (Chen et al., 2015).
This classification is accompanied by explicit syzygy formulas. For a nonzero nontrivial path 5, if 6 denotes the set of right-minimal paths 7 with 8, then there is an exact sequence
9
hence
0
If 1 is a perfect pair, then 2 and
3
In this sense, perfect pairs are exactly the configurations in which syzygy rotates between cyclic path modules (Chen et al., 2015).
For quadratic monomial algebras, the description becomes even sharper. Every perfect path is an arrow, and the relation quiver 4 has vertices given by arrows of 5, with an arrow 6 whenever 7. An arrow is perfect if and only if it lies in a connected component of 8 that is a basic cycle. If the perfect components are 9 with 0 vertices, then
1
so the Gorenstein-projective stable category is semisimple triangulated. In the same quadratic setting,
2
3 is CM-free exactly when 4 has no perfect component, and 5 has finite global dimension exactly when every component is acyclic. These criteria are not yet Auslander-Gorenstein criteria, but they supply the Gorenstein-projective infrastructure on which later Auslander-Gorenstein results rest (Chen et al., 2015).
3. Structural restrictions: string algebras, gentle algebras, and 2-Gorenstein shape
A major rigidity theorem states: 6 This is one of the strongest structural restrictions presently known for the monomial class. Since string algebras are monomial biserial algebras with the usual local uniqueness conditions on relations, the Auslander-Gorenstein property forces a substantial collapse from general monomial combinatorics to the string-algebra regime (Klász, 9 Aug 2025, Klász et al., 26 Aug 2025).
Within string algebras, the gentle case admits a complete combinatorial criterion. If 7 is gentle, then
8
Thus, in the gentle class, Auslander-Gorensteinness is purely local: a vertex has in-degree 9 exactly when it has out-degree 0. The same work also shows that for gentle algebras,
1
This is a particularly clean identification of Auslander-Gorenstein and low Gorenstein dimension inside a monomial subclass (Klász, 9 Aug 2025).
The paper further gives an explicit description of the Auslander-Reiten bijection 2 for Auslander-Gorenstein gentle algebras. Vertices of total degree 3 or 4 are fixed. In the remaining cases, 5 is determined by the source of a unique left-maximal path or the target of a unique maximal critical path, depending on the local in/out-degree configuration. This turns the abstract homological bijection into a concrete permutation of vertices in the gentle case (Klász, 9 Aug 2025).
The broader 2-Gorenstein monomial class is also classified by local quiver-relation data. A monomial algebra 6 is 7-Gorenstein if and only if 8 is biserial, every vertex satisfies
9
every degree-0 vertex satisfies the specific crossing pattern
1
with 2 not contained in any minimal relations, and any arrow appearing inside a minimal relation is either its start or its end. This theorem is the geometric starting point for the reduction theory of Auslander-Gorenstein monomial algebras (Klász, 9 Aug 2025).
4. Reduction to Nakayama algebras and quantitative consequences
The central technical innovation in the current classification program is a cutting procedure at degree-3 vertices. Starting from a 2-Gorenstein monomial algebra and a degree-4 vertex 5 with incoming arrows 6 and outgoing arrows 7 satisfying
8
one replaces 9 by two degree-0 vertices 1 and reconnects
2
leaving all other vertices, arrows, and relations unchanged. Repeated cutting removes branching and eventually transforms the algebra into a Nakayama algebra (Klász, 9 Aug 2025).
This procedure preserves the relevant homological conditions. For the cut pair 3, the theorem states that for every 4,
5
for every 6,
7
and moreover
8
As a consequence,
9
The survey literature emphasizes the significance of this reduction and also notes that a full classification of Auslander-Gorenstein Nakayama algebras remains open, although several important subclasses have been analyzed (Klász, 9 Aug 2025, Klász et al., 26 Aug 2025).
Two further quantitative results sharpen the homological picture. First, monomial algebras satisfy a parity phenomenon: 00 This extends an earlier result of Iwanaga and Fuller from the Nakayama case to all monomial algebras (Klász, 9 Aug 2025, Klász et al., 26 Aug 2025).
Second, if 01 is a monomial algebra with 02 simple modules and 03 is 04-Gorenstein, then
05
so 06 is 07-Iwanaga-Gorenstein. This is described as a stronger version of the Auslander-Reiten Conjecture in the monomial case. The survey presents it as a strong partial result toward the general conjectural picture (Klász, 9 Aug 2025, Klász et al., 26 Aug 2025).
The Nakayama endpoint of the reduction also carries independent combinatorics. The survey records that linear Nakayama algebras correspond to Dyck paths, that 08-Gorenstein linear Nakayama algebras were characterized by Dyck paths with no double deficiencies, and that these are counted by Motzkin paths. This suggests that the unresolved part of the general monomial classification is concentrated in an already highly structured uniserial environment (Klász et al., 26 Aug 2025).
5. Auslander-Reiten permutations, Coxeter matrices, and the acyclic Auslander regular case
The acyclic case admits a linear-algebraic classification of Auslander regularity. For a finite-dimensional algebra of finite global dimension, the Coxeter matrix is
09
where 10 is the Cartan matrix. The relevant matrix factorization is the Bruhat decomposition
11
with 12 upper triangular and 13 a permutation matrix. When 14, the associated permutation is called the Coxeter permutation (Klász et al., 2 Apr 2026).
For acyclic quiver algebras, the theory is formulated under a natural labelling of vertices, meaning 15 whenever there is a path from 16 to 17 with 18. Under the hypotheses used in the paper, a naturally labelled acyclic algebra with a well-defined inverse Auslander-Reiten map and property 19 satisfies: 20 In this case, the Coxeter permutation is the inverse of 21. Moreover, if 22 is Auslander regular and naturally labelled, then these conditions hold (Klász et al., 2 Apr 2026).
Specialized to monomial algebras, the main acyclic theorem states that if 23 is a 24-Gorenstein, acyclic monomial algebra with a natural labelling, then the following are equivalent:
- 25 is Auslander regular.
- There exists a Bruhat decomposition
26
with 27.
In this case, the Coxeter permutation coincides with the Auslander-Reiten permutation. For linear Nakayama algebras with canonical ordering 28, this criterion is equivalent to bijectivity of the inverse Auslander-Reiten map as well (Klász et al., 2 Apr 2026).
The proof uses the Euler-form formula
29
which identifies the first nonzero position in each row of 30 with the inverse Auslander-Reiten permutation. The survey places this in a broader framework: for Auslander regular algebras with an admissible ordering of simples, the Coxeter permutation coincides with the Auslander-Reiten permutation, so the matrix-theoretic permutation is a genuine homological invariant (Klász et al., 2 Apr 2026, Klász et al., 26 Aug 2025).
This line of work also resolves several questions in special families. For linear Nakayama algebras, Ringel’s homological permutation agrees with the Coxeter permutation, and for any Nakayama algebra and any simple module 31,
32
At the same time, the limits of the matrix criterion are explicit: the Bruhat criterion with 33 does not extend verbatim to arbitrary cyclic Nakayama algebras, and there are acyclic monomial algebras that are not 34-Gorenstein for which the matrix criterion can fail even when the Coxeter matrix exhibits favorable Bruhat behavior (Klász et al., 2 Apr 2026).
6. Related Calabi–Yau and weak Gorenstein regimes
A separate but closely related direction studies monomial Gorenstein algebras through their singularity categories. Over an algebraically closed field of characteristic zero, for a monomial algebra 35, the following are equivalent:
- 36 is 37-Calabi–Yau tilted.
- 38 is 39-Iwanaga–Gorenstein and its singularity category 40 is 41-Calabi–Yau.
- 42 is Jacobian.
This is a converse to the Keller–Reiten theorem in the monomial setting. For 43-Iwanaga–Gorenstein monomial algebras, the minimal zero-relations decompose into disjoint families 44 arising from cyclic paths 45, and the singularity category has the form
46
If 47 is 48-Calabi–Yau, then
49
and these numerical conditions yield a potential
50
showing that 51 is Jacobian (Elsener, 2018).
In the gentle subclass, the same numerical restriction becomes especially explicit. If a gentle algebra is 52-CY tilted, then every relation lies on either a saturated 53-cycle or a saturated loop. In the 54-angulated families, the resulting algebras are gentle, the only possible saturated cycles are 55-cycles, there are at most 56 consecutive zero-relations outside a saturated cycle, the algebras are 57-Iwanaga–Gorenstein, and
58
These results concern monomial Gorenstein and stably Calabi–Yau behavior rather than Auslander-Gorensteinness itself, but they show that monomial homological rigidity often emerges from numerical cycle data in the singularity category (Elsener, 2018).
A distinct weaker condition is weak Gorensteinness. One abstract states that algebras are left weakly Gorenstein in case the subcategory
59
is representation-finite, and that this applies in particular to all monomial algebras (Marczinzik, 2019). This is substantially weaker than being Auslander-Gorenstein. A common misconception is to identify broad Gorenstein-flavored regularity phenomena in monomial algebras with the Auslander-Gorenstein condition. The current literature instead indicates a hierarchy: perfect-path and relation-quiver methods describe Gorenstein-projective structure; weakly Gorenstein conditions impose Ext-syzygy regularity; 60-Iwanaga–Gorenstein plus stably 61-CY forces Jacobian and 62-CY tilted behavior in the monomial case; and Auslander-Gorensteinness is the stronger condition singled out by the bijective Auslander-Reiten map, the string-algebra restriction, and the reduction to Nakayama algebras (Chen et al., 2015, Elsener, 2018, Marczinzik, 2019, Klász, 9 Aug 2025).
The present picture is therefore both sharp and incomplete. The monomial Auslander-Gorenstein condition is now characterized homologically and strongly constrained combinatorially; gentle algebras are classified, the acyclic Auslander regular case is controlled by Coxeter-matrix Bruhat factorization, and the general problem reduces to Nakayama algebras. At the same time, the survey literature makes clear that a full classification of Auslander-Gorenstein Nakayama algebras remains open, so the reduction theorem isolates, rather than eliminates, the remaining core difficulty (Klász et al., 26 Aug 2025).