An Overview of the Computational Aspects of Nonunique Factorization Invariants
From MaRDI portal
Abstract: We give an overview of the existing algorithms to compute nonunique factorization invariants in finitely generated monoids.
Cites work
- A characterization of arithmetical invariants by the monoid of relations.
- A characterization of arithmetical invariants by the monoid of relations. II: The monotone catenary degree and applications to semigroup rings.
- An efficient incremental algorithm for solving systems of linear diophantine equations
- Atomic commutative monoids and their elasticity.
- Binomial ideals
- Delta sets of numerical monoids are eventually periodic.
- Elasticity of factorization in number fields
- Elements in a numerical semigroup with factorizations of the same length.
- Generators and relations of abelian semigroups and semigroup rings
- Half factorial domains
- scientific article; zbMATH DE number 1438385 (Why is no real title available?)
- scientific article; zbMATH DE number 3216273 (Why is no real title available?)
- Irreducible ideals of finitely generated commutative monoids
- Minimal presentations for monoids with the ascending chain condition on principal ideals.
- Numerical semigroups.
- On the delta set and the Betti elements of a BF-monoid.
- 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 maximal denumerant of a numerical semigroup.
Cited in
(21)- Delta sets for nonsymmetric numerical semigroups with embedding dimension three
- A realization theorem for sets of lengths in numerical monoids
- On factorization invariants and Hilbert functions
- On strongly primary monoids, with a focus on Puiseux monoids
- Factorization length distribution for affine semigroups. II: Asymptotic behavior for numerical semigroups with arbitrarily many generators
- Factorization theory in commutative monoids
- Factorization invariants in numerical monoids
- On dynamic algorithms for factorization invariants in numerical monoids
- Isolated factorizations and their applications in simplicial affine semigroups
- scientific article; zbMATH DE number 1532157 (Why is no real title available?)
- Sets of lengths
- Minimal presentations of shifted numerical monoids
- Approximating length-based invariants in atomic Puiseux monoids
- Critical binomial ideals of Northcott type
- On strongly primary monoids and domains
- The computation of factorization invariants for affine semigroups
- Factorization invariants of the additive structure of exponential Puiseux semirings
- Numerical semigroups, polyhedra, and posets. III: Minimal presentations and face dimension
- Counting edges in factorization graphs of numerical semigroup elements
- Ideal extensions of free commutative monoids
- On algebraic properties of power monoids of numerical monoids
Describes a project that uses
Uses Software
This page was built for publication: An Overview of the Computational Aspects of Nonunique Factorization Invariants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2826742)
