Papers
Topics
Authors
Recent
Search
2000 character limit reached

Singular equivalences of nn-adjoint type and standard eventually homological isomorphisms

Published 3 Sep 2026 in math.RT, math.KT, and math.RA | (2609.03365v1)

Abstract: We modify the definition of eventually homological isomorphisms so that it becomes more natural and fruitful. We introduce singular equivalences of nn-adjoint type which can be viewed as standard singular equivalences of different levels and are more convenient for reducing various homological conjectures and transferring homological properties. We develop the theories of singular equivalences of nn-adjoint type for n≥2n\ge 2 and standard eventually homological isomorphisms between derived categories by giving their characterizations in terms of ⊗\otimes-(co)perfect complexes of bimodules, two constructions via opposite algebras and tensor product algebras, examples induced by homomorphisms of algebras and idempotents, and applications to the reduction of homological conjectures such as the finitistic dimension conjecture, Gorenstein symmetry conjecture, Auslander-Reiten conjecture and Gorenstein projective conjecture, as well as to the preservation of homological properties such as Gorensteinness, the Fg condition, Happel's property and Han's property. Moreover, we show that standard eventually homological isomorphisms correspond to fully faithful standard triangle functors between singularity categories with canonical left adjoint, and essentially surjective standard eventually homological isomorphisms between derived categories correspond to singular equivalences of 3-adjoint type, thereby incorporating essentially surjective standard eventually homological isomorphisms into the framework of singular equivalences of 3-adjoint type.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.