Lattice walks and primary decomposition

MaRDI QIDQ4400928zbMATH OpenFDO

Authors Persi Diaconis, David Eisenbud, Bernd Sturmfels

Publication date 30 September 1998

zbMATH Keywords

binomialcharacterizationcircuitcombinatorial problemscomponents of a graphlattice walksmatrixminorprimary decompositions of an idealstatistical example

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Graph theory (05C99) Algebraic combinatorics (05E99) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Recommendations

• On the primary decomposition of some determinantal hyperedge ideal
• Primary decompositions with sections on Macaulay2 and networks
• Combinatorics of binomial primary decomposition
• Tools for computing primary decompositions and applications to ideals associated to Bayesian networks

Cited in

(37)

• Toric ideals and diagonal 2-minors
• Algebraic algorithms for sampling from conditional distributions
• Index of nilpotency of binomial ideals.
• Gröbner bases and polyhedral geometry of reducible and cyclic models.
• Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
• Ideals of adjacent minors
• Ideals generated by adjacent 2-minors
• Correspondence scrolls
• Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure
• Determinantal facet ideals for smaller minors
• On connectivity of fibers with positive marginals in multiple logistic regression
• Commuting birth-and-death processes
• Sampling algebraic sets in local intrinsic coordinates
• Ideals generated by diagonal 2-minors
• Primary decompositions with sections on Macaulay2 and networks
• Graphs and ideals generated by some 2-minors
• Positive margins and primary decomposition
• Markov bases and toric ideals for some contingency tables
• scientific article; zbMATH DE number 7099278 (Why is no real title available?)
• Chordal networks of polynomial ideals
• The binomial edge ideal of a pair of graphs
• Construction of Cohen-Macaulay binomial edge ideals
• Tools for computing primary decompositions and applications to ideals associated to Bayesian networks
• From Polynomial Invariants to Linear Loops
• Rees algebras of unit interval determinantal facet ideals
• Powers of generalized binomial edge ideals of path graphs
• d-sequence edge binomials, and regularity of powers of binomial edge ideals of trees
• Generalized binomial edge ideals of bipartite graphs
• Choosing the variable ordering for cylindrical algebraic decomposition via exploiting chordal structure
• On a regularity-conjecture of generalized binomial edge ideals
• Siphons in chemical reaction networks
• Algorithms for computing a primary ideal decomposition without producing intermediate redundant components
• Algorithm for direct sampling from conditional distributions of toric models
• Distance-reducing Markov bases for sampling from a discrete sample space
• Matchings in simplicial complexes, circuits and toric varieties
• The circuit ideal of a vector configuration
• Binomial edge ideals and conditional independence statements

This page was built for publication: Lattice walks and primary decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4400928)