On decomposable semigroups and applications.
DOI10.1016/j.jsc.2013.05.009zbMath1286.20069arXiv1006.2557MaRDI QIDQ2437287
M. A. Moreno-Frías, Alberto Vigneron-Tenorio, Juan Ignacio García García
Publication date: 3 March 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.2557
simplicial complexes; polynomial-time algorithms; algebraic statistics; lattice ideals; Markov bases; semigroup ideals; decomposable varieties; decomposable semigroups; generating sets of ideals; HNF-decompositions
68W30: Symbolic computation and algebraic computation
20M12: Ideal theory for semigroups
20M05: Free semigroups, generators and relations, word problems
20-04: Software, source code, etc. for problems pertaining to group theory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Uniquely presented finitely generated commutative monoids.
- Computing generating sets of lattice ideals and Markov bases of lattices
- Simplicial complexes and minimal free resolution of monomial algebras
- Indispensable monomials of toric ideals and Markov bases
- Lectures on algebraic statistics
- Semigroup ideals and linear Diophantine equations
- On presentations of subsemigroups of \(\mathbb{N}^n\)
- Minimal systems of generators for ideals of semigroups
- Minimal presentations for monoids with the ascending chain condition on principal ideals.
- Algebraic algorithms for sampling from conditional distributions
- Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
- Generators and relations of abelian semigroups and semigroup rings
- Indispensable binomials in semigroup ideals
- Minimal systems of binomial generators and the indispensable complex of a toric ideal
- Algorithms in invariant theory
