The computation of factorization invariants for affine semigroups
From MaRDI portal
Abstract: We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set of any affine semigroup, (ii) an improved method of computing the tame degree of an affine semigroup, and (iii) a dynamic algorithm to compute catenary degrees of affine semigroup elements. Our algorithms rely on theoretical results from combinatorial commutative algebra involving Gr"obner bases, Hilbert bases, and other standard techniques. Implementation in the computer algebra system GAP is discussed.
Recommendations
- Factorization invariants in half-factorial affine semigroups.
- A characterization of arithmetical invariants by the monoid of relations. II: The monotone catenary degree and applications to semigroup rings.
- On factorization invariants and Hilbert functions
- On the computation of the Apéry set of numerical monoids and affine semigroups
- Algorithms for generalized numerical semigroups
Cites work
- scientific article; zbMATH DE number 1438385 (Why is no real title available?)
- scientific article; zbMATH DE number 3216273 (Why is no real title available?)
- An Overview of the Computational Aspects of Nonunique Factorization Invariants
- Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.
- Delta sets for nonsymmetric numerical semigroups with embedding dimension three
- Factorization invariants in half-factorial affine semigroups.
- Factorization invariants in numerical monoids
- Generators and relations of abelian semigroups and semigroup rings
- Geometric notes on monoids
- Ideals, Varieties, and Algorithms
- Irreducible ideals of finitely generated commutative monoids
- Local and global tameness in Krull monoids.
- Non-unique factorizations. Algebraic, combinatorial and analytic theory
- Normaliz: Algorithms for affine monoids and rational cones
- Numerical semigroups.
- On dynamic algorithms for factorization invariants in numerical monoids
- On factorization invariants and Hilbert functions
- On the delta set and the Betti elements of a BF-monoid.
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids.
- The catenary and tame degree in finitely generated commutative cancellative monoids.
- The catenary and tame degree of numerical monoids
- The catenary and tame degrees on a numerical monoid are eventually periodic
- The power of pyramid decomposition in Normaliz
- numericalsgps, a GAP package for numerical semigroups
Cited in
(14)- Factorization invariants of Puiseux monoids generated by geometric sequences
- The structure theorem for sets of lengths for numerical semigroups
- Factorizations of the same length in abelian monoids
- Beyond Coins, Stamps, and Chicken McNuggets: An Invitation to Numerical Semigroups
- Delta sets for symmetric numerical semigroups with embedding dimension three
- Factorization theory in commutative monoids
- An improved algorithm to compute the -primality
- Counting edges in factorization graphs of numerical semigroup elements
- Factorizations in upper triangular matrices over information semialgebras
- Geometric and combinatorial aspects of submonoids of a finite-rank free commutative monoid
- Factorization invariants in half-factorial affine semigroups.
- Atoms of root-closed submonoids of \(\mathbb{Z}^2\)
- Ideal extensions of free commutative monoids
- On the arithmetic of stable domains
Describes a project that uses
Uses Software
This page was built for publication: The computation of factorization invariants for affine semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5376498)
