REVIEW 5 cited by
Auslander regular algebras and Coxeter matrices
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Auslander regular algebras and Coxeter matrices
read the original abstract
We show that Iyama's grade bijection for Auslander-Gorenstein algebras coincides with the bijection introduced by Auslander-Reiten. This result uses a new characterisation of Auslander-Gorenstein algebras. Furthermore, we show that the grade bijection of an Auslander regular algebra coincides with the permutation matrix P in the Bruhat factorisation of the Coxeter matrix. This gives a new, purely linear algebraic interpretation of the grade bijection and allows us to calculate it in a much quicker way than was previously known. We give several applications of our main results. First, we show that the permanent of the Coxeter matrix of an Auslander regular algebra is either 1 or -1. Second, we obtain a new combinatorial characterisation of distributive lattices among the class of finite lattices. Explicitly, a lattice is distributive if and only if its Coxeter matrix can be written as PU where P is a permutation matrix and U is an upper triangular matrix. Other applications include new homological results about modules in blocks of category $\mathcal{O}$ of semisimple Lie algebras.
Forward citations
Cited by 5 Pith papers
-
$(P,\phi)$-Tamari and higher torsion lattices of type $\mathbf{A}$
Defines (P,φ)-Tamari lattices as a generalization of the Tamari lattice and uses them to establish join-semidistributivity and related properties for higher torsion class lattices of type A algebras.
-
Short Proofs in Algebraic and Enumerative Combinatorics
AI-generated short proofs resolve multiple open conjectures in combinatorics.
-
Short Proofs in Algebraic and Enumerative Combinatorics
Short AI-generated proofs resolve open conjectures on echelonmotion operators, parking function statistics, and plactic monoid centralizers.
-
Short Proofs in Algebraic and Enumerative Combinatorics
AI-generated short proofs resolve conjectures on the echelonmotion operator, parking function statistics, and plactic monoid centralizers.
-
Spherical modules and the Auslander--Gorenstein condition for Auslander--Yoneda algebras
Introduces spherical algebras (all indecomposables spherical) and proves the Auslander-Yoneda algebra is Auslander-Gorenstein iff all indecomposables are spherical, with characterizations via split torsion pairs, dire...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.