Abstract
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.
The authors are grateful to the NSF for partial support during the preparation of this paper. The third author is also supported by a David and Lucile Packard Fellowship.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. F. Atiyah and I. G. Macdonald, Introduction to Commutative Algebra, Addison Wesley, Reading, MA, 1969.
T. Becker, V. Weispfenning, Grobner Bases: A Computational Approach to Commutative Algebra, Graduate Texts in Mathematics, Springer, New York, 1993.
D. Cox, J. Little, and D. O’Shea, Ideals, Varieties, and Algorithms, Springer-Verlag, NY, 1992.
P. Diaconis and B. Sturmfels, Algebraic algorithms for sampling from conditional distributions, to appear inAnnals of Statistics.
D. Eisenbud, Commutative Algebra with a View Toward Algebraic Geometry, Springer-Verlag, NY, 1995.
D. Eisenbud and B. Sturmfels, Binomial ideals, Duke Mathematical Journal 84 (1996), 1–45.
G. Glonek, Some aspects of log linear models. Thesis, School of Math. Sci., Flinders Univ. of S. Australia, 1987.
J. Harris, Algebraic Geometry, Graduate Texts in Math., Springer, New York, 1992.
E. Mayr and A. Meyer, The complexity of the word problem for commutative semigroups and polynomial ideals, Advances in Mathematics 46 (1982) 305–329.
B. Sturmfels, Grobner Bases and Convex Polytopes, American Mathematics Society, Providence, RI, 1995.
R.R. Thomas, A geometric Buchberger algorithm for integer programming, Mathematics of Operations Research 20 (1995), 864–884.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Birkhäuser
About this chapter
Cite this chapter
Diaconis, P., Eisenbud, D., Sturmfels, B. (1998). Lattice Walks and Primary Decomposition. In: Sagan, B.E., Stanley, R.P. (eds) Mathematical Essays in honor of Gian-Carlo Rota. Progress in Mathematics, vol 161. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-4108-9_8
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4108-9_8
Publisher Name: Birkhäuser Boston
Print ISBN: 978-1-4612-8656-1
Online ISBN: 978-1-4612-4108-9
eBook Packages: Springer Book Archive