The norm of the saturation of a binomial ideal, with applications to Markov bases
From MaRDI portal
Publication:2659093
Abstract: Given a pure binomial ideal I in variables x_i, we define a new measure of the complexity of the saturation of I with respect to the product of the variables x_i, which we call the norm. We give a bound on the norm in terms of easily-computed invariants of the ideal. We discuss statistical applications both practical and theoretical.
Recommendations
- A saturation algorithm for homogeneous binomial ideals
- Markov bases and toric ideals for some contingency tables
- Saturations of powers of certain determinantal ideals
- The saturation of frobenius powers of ideals
- Markov bases of toric ideals: connecting commutative algebra and statistics
- The saturation number of monomial ideals
- Binomial edge ideals and bounds for their regularity
- Some results on special binomial ideals
- The saturation number of \(\mathbf{c}\)-bounded stable monomial ideals and their powers
- Binomial expansion for saturated and symbolic powers of sums of ideals
Cites work
- Binomial ideals
- Computing toric ideals
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- Introduction to Toric Varieties. (AM-131)
- Markov degree of configurations defined by fibers of a configuration
- Markov degree of the three-state toric homogeneous Markov chain model
- Rapid mixing and Markov bases
- The fiber dimension of a graph
- The Magma algebra system. I: The user language
This page was built for publication: The norm of the saturation of a binomial ideal, with applications to Markov bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2659093)