The norm of the saturation of a binomial ideal, and applications to Markov bases
Abstract
Given a pure binomial ideal I in variables xi, we define a new measure of the complexity of the saturation of I with respect to the product of the variables xi, 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.