The following pages link to Computing toric ideals (Q1283192):
Displaying 24 items.
- Border bases for lattice ideals (Q321275) (← links)
- A class of statistical models to weaken independence in two-way contingency tables (Q622554) (← links)
- Computing inhomogeneous Gröbner bases (Q633077) (← links)
- Lattice polly cracker cryptosystems (Q633081) (← links)
- Saturations of subalgebras, SAGBI bases, and U-invariants (Q820960) (← links)
- Computing generating sets of lattice ideals and Markov bases of lattices (Q840713) (← links)
- Binomial fibers and indispensable binomials (Q898283) (← links)
- On selection of nonmultiplicative prolongations in computation of Janet bases (Q926621) (← links)
- Combinatorial mutations and block diagonal polytopes (Q2131124) (← links)
- Minimal generating sets of lattice ideals (Q2404863) (← links)
- Computing zero-dimensional schemes (Q2456531) (← links)
- Markov bases and structural zeros (Q2457323) (← links)
- Algebraic exact inference for rater agreement models (Q2493251) (← links)
- Markov bases and subbases for bounded contingency tables (Q2634809) (← links)
- The norm of the saturation of a binomial ideal, with applications to Markov bases (Q2659093) (← links)
- Koszul Algebras and Computations (Q2974695) (← links)
- Indispensable binomials in semigroup ideals (Q3065700) (← links)
- On the equations defining toric l.c.i.-singularities (Q4425453) (← links)
- On ideal lattices, Gröbner bases and generalized hash functions (Q4563584) (← links)
- Algebraic Markov Bases and MCMC for Two‐Way Contingency Tables (Q4828206) (← links)
- CRITICAL BINOMIAL IDEALS OF NORTHCOTT TYPE (Q5093760) (← links)
- Examples of Generic Lattice Ideals of Codimension 3 (Q5444901) (← links)
- Decompositions of binomial ideals (Q5919750) (← links)
- Factorizations of the same length in abelian monoids (Q6054806) (← links)
