Explicit Deformation of Lattice Ideals via Chip Firing Games on Directed Graphs

Abstract

For a finite index sublattice L of the root lattice An, we construct a deterministic algorithm to deform the lattice ideal IL to a nearby generic lattice ideal, answering a question posed by Miller and Sturmfels. Our algorithm is based on recent results of Perkinson, Perlman and Wilmes concerning commutative algebraic aspects of chip firing on directed graphs. As an application of our deformation algorithm, we construct a cellular resolution of the lattice ideal IL by degenerating the Scarf complex of its deformation.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…