On decomposable semigroups and applications.

DOI10.1016/J.JSC.2013.05.009MaRDI QIDQ2437287zbMATH OpenOpenAlexFDO

Authors M. A. Moreno-Frías, A. Vigneron-Tenorio, J. I. 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

zbMATH Keywords

algebraic statisticssimplicial complexespolynomial-time algorithmslattice idealsMarkov basessemigroup idealsdecomposable varietiesdecomposable semigroupsgenerating sets of idealsHNF-decompositions

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Ideal theory for semigroups (20M12) Free semigroups, generators and relations, word problems (20M05) Software, source code, etc. for problems pertaining to group theory (20-04)

Abstract: The aim of this work is to reduce the complexity of the available algorithms for computing the generator sets of a semigroup ideal by using the Hermite normal form. In order to achieve it we introduce the concept of decomposable semigroup. If a semigroup is decomposable, the computation of its ideal is equivalent to compute the ideals of each semigroup in the decomposition, thus obtaining a reduction of the complexity of the algorithms. Furthermore, since these computations are mutually independent, they can be carried out in parallel. The concept of decomposable variety is introduced and a combinatorial characterization of decomposable semigroup is obtained. Some applications are also provided.

Recommendations

• Decomposition of semigroup algebras
• Computation of the decomposition group of a triangular ideal
• Minimal systems of generators for ideals of semigroups
• Decomposition of monomial algebras: applications and algorithms
• Semigroups -- a computational approach

Cites work

• scientific article; zbMATH DE number 3902926 (Why is no real title available?)
• scientific article; zbMATH DE number 493147 (Why is no real title available?)
• scientific article; zbMATH DE number 1560708 (Why is no real title available?)
• scientific article; zbMATH DE number 1744839 (Why is no real title available?)
• scientific article; zbMATH DE number 835749 (Why is no real title available?)
• scientific article; zbMATH DE number 1438385 (Why is no real title available?)
• scientific article; zbMATH DE number 2190625 (Why is no real title available?)
• Algebraic algorithms for sampling from conditional distributions
• Algorithms in invariant theory
• Computing generating sets of lattice ideals and Markov bases of lattices
• Generators and relations of abelian semigroups and semigroup rings
• Indispensable binomials in semigroup ideals
• Indispensable monomials of toric ideals and Markov bases
• Lectures on algebraic statistics
• Minimal presentations for monoids with the ascending chain condition on principal ideals.
• Minimal systems of binomial generators and the indispensable complex of a toric ideal
• Minimal systems of generators for ideals of semigroups
• On presentations of subsemigroups of \(\mathbb{N}^n\)
• Semigroup ideals and linear Diophantine equations
• Simplicial complexes and minimal free resolution of monomial algebras
• Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
• Uniquely presented finitely generated commutative monoids.

Cited in

(3)

• Decomposition of semigroup algebras
• On Finite Complete Presentations and Exact Decompositions of Semigroups
• Discrete semi-self-decomposability induced by semigroups

Describes a project that uses

Uses Software

• 4ti2
• HnfDecomposition

This page was built for publication: On decomposable semigroups and applications.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437287)