AbstractExtending the notion of indispensable binomials of a toric ideal [Takemura, Akimichi, Aoki, Satoshi, 2004. Some characterizations of minimal Markov basis for sampling from discrete conditional distributions. Ann. Inst. Statist. Math. 56 (1), 1–17; Ohsugi, Hidefumi, Hibi, Takayuki, 2005. Indispensable binomials of finite graphs. J. Algebra Appl. 4 (4), 421–434], we define indispensable monomials of a toric ideal and establish some of their properties. They are useful for searching indispensable binomials of a toric ideal and for proving the existence or non-existence of a unique minimal system of binomial generators of a toric ideal. Some examples of indispensable monomials from statistical models for contingency tables are given
The main goal of this paper is to characterize a particular class of ideals whose structure can stil...
The main goal of this paper is to characterize a particular class of ideals whose structure can stil...
Abstract. Associated to any hypergraph is a toric ideal encoding the algebraic relations among its e...
AbstractExtending the notion of indispensable binomials of a toric ideal [Takemura, Akimichi, Aoki, ...
The main objective of this work is to study Markov bases and toric ideals for p(v−1)(p−v)/2v × v× p/...
Computing the complexity of Markov bases is an extremely challenging problem; no formula is known in...
AbstractLet IG be the toric ideal of a graph G. We characterize in graph theoretical terms the primi...
AbstractWe define the largest group of invariance for a given toric ideal and the associated Markov ...
Toric ideals are binomial ideals which represent the algebraic relations of finite sets of power-pro...
AbstractWe define the largest group of invariance for a given toric ideal and the associated Markov ...
We prove that iterated toric fibre products from a finite collection of toric varieties are defined ...
Diaconis-Sturmfels developed an algorithm for sampling from conditional distributions for a statisti...
In this paper we define an invariant Markov basis for a connected Markov chain over the set of conti...
Historically, the study of monomial ideals became fashionable after the pioneering work by Richard S...
The main goal of this paper is to characterize a particular class of ideals whose structure can stil...
The main goal of this paper is to characterize a particular class of ideals whose structure can stil...
The main goal of this paper is to characterize a particular class of ideals whose structure can stil...
Abstract. Associated to any hypergraph is a toric ideal encoding the algebraic relations among its e...
AbstractExtending the notion of indispensable binomials of a toric ideal [Takemura, Akimichi, Aoki, ...
The main objective of this work is to study Markov bases and toric ideals for p(v−1)(p−v)/2v × v× p/...
Computing the complexity of Markov bases is an extremely challenging problem; no formula is known in...
AbstractLet IG be the toric ideal of a graph G. We characterize in graph theoretical terms the primi...
AbstractWe define the largest group of invariance for a given toric ideal and the associated Markov ...
Toric ideals are binomial ideals which represent the algebraic relations of finite sets of power-pro...
AbstractWe define the largest group of invariance for a given toric ideal and the associated Markov ...
We prove that iterated toric fibre products from a finite collection of toric varieties are defined ...
Diaconis-Sturmfels developed an algorithm for sampling from conditional distributions for a statisti...
In this paper we define an invariant Markov basis for a connected Markov chain over the set of conti...
Historically, the study of monomial ideals became fashionable after the pioneering work by Richard S...
The main goal of this paper is to characterize a particular class of ideals whose structure can stil...
The main goal of this paper is to characterize a particular class of ideals whose structure can stil...
The main goal of this paper is to characterize a particular class of ideals whose structure can stil...
Abstract. Associated to any hypergraph is a toric ideal encoding the algebraic relations among its e...