Lattice Walks and Primary Decomposition

This paper shows how primary decompositions of an ideal can give useful descriptions of components of a graph arising in problems from combinatorics, statistics, and operations research. We begin this introduction with the general formulation. Then we give the simplest interesting example of our theory, followed by a statistical example similar to that which provided our original motivation. Later on we study the primary decompositions corresponding to some natural combinatorial problems.