Algebraic study on permutation graphs
Abstract
Let G be a permutation graph. We show that G is Cohen-Macaulay if and only if G is unmixed and vertex decomposable. When this is the case, we obtain a combinatorial description for the a-invariant of G. Moreover, we characterize the Gorenstein permutation graphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.