scientific article; zbMATH DE number 1182838

zbMATH Open0962.05010MaRDI QIDQ4400928FDOQ4400928

Authors: Persi Diaconis, David Eisenbud, Bernd Sturmfels 

Publication date: 30 September 1998

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

binomialmatrixminorcharacterizationcircuitcombinatorial problemslattice walkscomponents of a graphprimary decompositions of an idealstatistical example

Mathematics Subject Classification ID

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

Cited In (35)

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

This page was built for publication:

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