We study three invariants of geometrically vertex decomposable
ideals: the Castelnuovo–Mumford regularity, the multiplicity, and the
-invariant.
We show that these invariants can be computed recursively using the ideals that
appear in the geometric vertex decomposition process.
As an application, we prove that the
-invariant
of a geometrically vertex decomposable ideal is nonpositive. We also recover some
previously known results in the literature including a formula for the regularity of the
Stanley–Reisner ideal of a pure vertex decomposable simplicial complex, and
proofs that some well-known families of ideals are Hilbertian. Finally, we
apply our recursions to the study of toric ideals of bipartite graphs. Included
among our results on this topic is a new proof for a known bound on the
-invariant
of a toric ideal of a bipartite graph.