370 research outputs found

    Tilting theory of noetherian algebras

    Full text link
    For a ring Λ\Lambda with a Krull-Schmidt homotopy category, we study mutation theory on 22-term silting complexes. As a consequence, mutation works when Λ\Lambda is a complete noetherian algebra, that is, a module-finite algebra over a commutative complete local noetherian ring RR. By using results on 22-term silting complexes of such noetherian algebras and τ\tau-tilting theory of Artin algebras, we study torsion classes of the module category of a noetherian algebra. When RR has Krull dimension one, the set of torsion classes of Λ\Lambda is decomposed into subsets so that each subset bijectively corresponds to a certain subset of the set of torsion classes of Artin algebras.Comment: 26 page

    Highest weight representations and Kac determinants for a class of conformal Galilei algebras with central extension

    Full text link
    We investigate the representations of a class of conformal Galilei algebras in one spatial dimension with central extension. This is done by explicitly constructing all singular vectors within the Verma modules, proving their completeness and then deducing irreducibility of the associated highest weight quotient modules. A resulting classification of infinite dimensional irreducible modules is presented. It is also shown that a formula for the Kac determinant is deduced from our construction of singular vectors. Thus we prove a conjecture of Dobrev, Doebner and Mrugalla for the case of the Schrodinger algebra.Comment: 24 page

    Classifying torsion pairs of Noetherian algebras

    Full text link
    For a commutative Noetherian ring RR and a module-finite RR-algebra Λ\Lambda, we study the set torsΛ\mathsf{tors} \Lambda (respectively, torfΛ\mathsf{torf}\Lambda) of torsion (respectively, torsionfree) classes of the category of finitely generated Λ\Lambda-modules. We construct a bijection from torfΛ\mathsf{torf}\Lambda to ptorf(ΛRκ(p))\prod_{\mathfrak{p}} \mathsf{torf}(\Lambda\otimes_R \kappa(\mathfrak{p})), and an embedding Φ\Phi from torsΛ\mathsf{tors} \Lambda to TR(Λ):=ptors(ΛRκ(p))\mathbb{T}_R(\Lambda):=\prod_{\mathfrak{p}} \mathsf{tors}(\Lambda\otimes_R \kappa(\mathfrak{p})), where p\mathfrak{p} runs all prime ideals of RR. When Λ=R\Lambda=R, these give classifications of torsionfree classes, torsion classes and Serre subcategories of modR\mathsf{mod} R due to Takahashi, Stanley-Wang and Gabriel. To give a description of ImΦ\mathrm{Im} \Phi, we introduce the notion of compatible elements in TR(Λ)\mathbb{T}_R(\Lambda), and prove that all elements in ImΦ\mathrm{Im} \Phi are compatible. We give a sufficient condition on (R,Λ)(R, \Lambda) such that all compatible elements belong to ImΦ\mathrm{Im} \Phi (we call (R,Λ)(R, \Lambda) compatible in this case). For example, if RR is semi-local and dimR1\dim R \leq 1, then (R,Λ)(R, \Lambda) is compatible. We also give a sufficient condition in terms of silting Λ\Lambda-modules. As an application, for a Dynkin quiver QQ, (R,RQ)(R, RQ) is compatible and we have a poset isomorphism torsRQHomposet(SpecR,CQ)\mathsf{tors} RQ \simeq \mathsf{Hom}_{\rm poset}(\mathsf{Spec} R, \mathfrak{C}_Q) for the Cambrian lattice CQ\mathfrak{C}_Q of QQ.Comment: 33 pages, one subsection was moved to Appendix, some propositions were added in Section

    Improving Rewriting Induction Approach for Proving Ground Confluence

    Get PDF
    In (Aoto&Toyama, FSCD 2016), a method to prove ground confluence of many-sorted term rewriting systems based on rewriting induction is given. In this paper, we give several methods that add wider flexibility to the rewriting induction approach for proving ground confluence. Firstly, we give a method to deal with the case in which suitable rules are not presented in the input system. Our idea is to construct additional rewrite rules that supplement or replace existing rules in order to obtain a set of rules that is adequate for applying rewriting induction. Secondly, we give a method to deal with non-orientable constructor rules. This is accomplished by extending the inference system of rewriting induction and giving a sufficient criterion for the correctness of the system. Thirdly, we give a method to deal with disproving ground confluence. The presented methods are implemented in our ground confluence prover AGCP and experiments are reported. Our experiments reveal the presented methods are effective to deal with problems for which state-of-the-art ground confluence provers can not handle
    corecore