Lyubeznik Tables of Ideals of Cycle Graphs

TL;DR

This paper computes the last column of the Lyubeznik table for the edge ideal of cycle graphs, providing insights into algebraic invariants related to these combinatorial structures.

Contribution

It introduces a method to explicitly compute the last column of the Lyubeznik table for ideals of cycle graphs, a novel contribution in algebraic combinatorics.

Findings

Explicit computation of the last column of Lyubeznik tables for cycle graph ideals

Enhanced understanding of algebraic invariants of cycle graph ideals

Potential applications in algebraic geometry and combinatorics

Abstract

Let R = K[x_1; : : : ; x_n] be a polynomial ring over a field K, and I := I_C_n be an edge ideal of n-cycle graph C_n. In the present paper, we compute the last column of the Lyubeznik table of R/I.