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.












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)