Castelnuovo-Mumford Regularity and Combinatorial Invariants of Trees

Abstract

This work establishes combinatorial bounds on the Castelnuovo-Mumford regularity of edge ideals for trees and their multi-whiskered variants. For a tree \( T \), we give bounds for the Castelnuovo-Mumford regularity of \( I(T) \) in terms of the order, diameter, and number of pendant vertices. Furthermore, we present an upper bound for multi-whiskered trees \( Ta \), demonstrating that the Castelnuovo-Mumford regularity of \( I(Ta) \) is bounded by the same invariants of the underlying tree \( T \). A principal consequence of this work is the derivation of corresponding inequalities for two key combinatorial invariants of \( T \), namely the induced matching number \( im(T) \) and the independence number \( α(T) \).

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…