Abstract
This chapter contains three major sections, each one roughly corresponding to a lecture. The first section is on computing primary decompositions, the second one is more specifically on binomial ideals, and the last one is on some primary decomposition questions in algebraic statistics and networks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ay, N., Rauh, J.: Robustness and conditional independence ideals. Preprint (2011). arXiv:1110.1338
Bruns, W., Vetter, U.: Determinantal Rings. Lecture Notes in Mathematics, vol. 1327. Springer, Berlin (1988)
Decker, W., Greuel, G.-M., Pfister, G.: Primary decomposition: algorithms and comparisons. In: Algorithmic Algebra and Number Theory (Heidelberg, 1997), pp. 187–220. Springer, Berlin (1999)
Diaconis, P., Sturmfels, B.: Algebraic algorithms for sampling from conditional distributions. Ann. Stat. 26, 363–397 (1998)
Drton, M., Sturmfels, B., Sullivant, S.: Lectures on Algebraic Statistics. Oberwolfach Seminars, vol. 39. Birkhäuser, Basel (2009)
Eisenbud, D., Sturmfels, B.: Binomial ideals. Duke Math. J. 84, 1–45 (1996)
Eisenbud, D., Huneke, C., Vasconcelos, W.: Direct methods for primary decomposition. Invent. Math. 110, 207–235 (1992)
Fink, A.: The binomial ideal of the intersection axiom for conditional probabilities. J. Algebraic Combin. 33, 455–463 (2011)
Gianni, P., Trager, B., Zacharias, G.: Gröbner bases and primary decompositions of polynomial ideals. J. Symbolic Comput. 6, 149–167 (1988)
Grayson, D.R., Stillman, M.E.: Macaulay2, a software system for research in algebraic geometry. Available at http://www.math.uiuc.edu/Macaulay2/
Herzog, J., Hibi, T., Hreinsdottir, F., Kahle, T., Rauh, J.: Binomial edge ideals and conditional independence statements. Adv. Appl. Math. 45, 317–333 (2010)
Kahle, T.: Decompositions of binomial ideals in Macaulay2. J. Softw. Algebra Geom. 4, 1–5 (2012)
Kreuzer, M., Robbiano, L.: Computational Commutative Algebra 1. Springer, Berlin (2008). Corrected reprint of the 2000 original
Krick, T., Logar, A.: An algorithm for the computation of the radical of an ideal in the ring of polynomials. In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (New Orleans, LA, 1991). Lecture Notes in Computer Science, vol. 539, pp. 195–205. Springer, Berlin (1991)
Laubenbacher, R.C., Swanson, I.: Permanental ideals. J. Symb. Comput. 30, 195–205 (2000)
Lauritzen, S.L.: Graphical Models. Oxford Statistical Science Series, vol. 17. Oxford Science Publications/The Clarendon Press/Oxford University Press, New York (1996)
Morey, S., Villarreal, R.: Edge ideals: algebraic and combinatorial properties. Prog. Commut. Algebra 1, 85–126 (2012)
Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45, 167–256 (2003)
Ohtani, M.: Graphs and ideals generated by some 2-minors. Commun. Algebra 39, 905–917 (2011)
Ojeda, I.: Binomial canonical decompositions of binomial ideals. Commun. Algebra 39, 3722–3735 (2011)
Ojeda, I., Piedra-Sánchez, R.: Canonical decomposition of polynomial ideals. Unpublished preprint. http://departamento.us.es/da/prepubli/prepub54.pdf (1999)
Ojeda, I., Piedra-Sánchez, R.: Index of nilpotency of binomial ideals. J. Algebra 255, 135–147 (2002)
Ortiz, V.: Sur une certaine decomposition canonique d’un idéal en intersection d’idéaux primaires dans un anneau noetherien commutatif. C. R. Acad. Sci. Paris 248, 3385–3387 (1959)
Pistone, G., Riccomagno, E., Wynn, H.P.: Algebraic Statistics. Computational Commutative Algebra in Statistics. Monographs on Statistics and Applied Probability, vol. 89. Chapman & Hall/CRC, Boca Raton (2001)
Sáenz-de-Cabezón, E., Wynn, H.P.: Measuring the robustness of a network using minimal vertex covers. Math. Comput. Simul. 104, 82–94 (2014)
Shimoyama, T., Yokoyama, K.: Localization and primary decomposition of polynomial ideals. J. Symbolic Comput. 22, 247–277 (1996)
Studený, M.: Attempts at axiomatic description of conditional independence. Kybernetika (Prague) Suppl. 25 (1–3), 72–79 (1989); Workshop on Uncertainty Processing in Expert Systems (Alšovice, 1988)
Swanson, I., Taylor, A.: Minimal primes of ideals arising from conditional independence statements. J. Algebra 392, 299–314 (2013)
Villarreal, R.: Monomial Algebras. Monographs and Textbooks in Pure and Applied Mathematics, vol. 238. Marcel Dekker, New York (2001)
von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, Cambridge (2003)
Yao, Y.: Primary decomposition: compatibility, independence and linear growth. Proc. Am. Math. Soc. 130, 1629–1637 (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Swanson, I., Sáenz-de-Cabezón, E. (2017). Primary Decompositions. In: Bigatti, A., Gimenez, P., Sáenz-de-Cabezón, E. (eds) Computations and Combinatorics in Commutative Algebra. Lecture Notes in Mathematics, vol 2176. Springer, Cham. https://doi.org/10.1007/978-3-319-51319-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-51319-5_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-51318-8
Online ISBN: 978-3-319-51319-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)