On dynamic algorithms for factorization invariants in numerical monoids
From MaRDI portal
Abstract: Studying the factorization theory of numerical monoids relies on understanding several important factorization invariants, including length sets, delta sets, and -primality. While progress in this field has been accelerated by the use of computer algebra systems, many existing algorithms are computationally infeasible for numerical monoids with several irreducible elements. In this paper, we present dynamic algorithms for the factorization set, length set, delta set, and -primality in numerical monoids and demonstrate that these algorithms give significant improvements in runtime and memory usage. In describing our dynamic approach to computing -primality, we extend the usual definition of this invariant to the quotient group of the monoid and show that several useful results naturally extend to this broader setting.
Recommendations
- Factorization invariants in numerical monoids
- On numerical invariants in algebraic complexity theory
- scientific article; zbMATH DE number 2185574
- An Overview of the Computational Aspects of Nonunique Factorization Invariants
- Factorizations of algebraic integers, block monoids, and additive number theory
- On factorization of monoids
- Algorithms for calculating the set of integers contained in a monoid finitely generated by positive rational numbers
- Algorithms for embedded monoids and base point free problems
- An algorithm to compute -primality in a numerical monoid.
- FACTORIZATION IN MONOID DOMAINS
Cites work
- An algorithm to compute -primality in a numerical monoid.
- Computation of delta sets of numerical monoids.
- Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.
- Decomposition of a numerical semigroup as an intersection of irreducible numerical semigroups.
- Delta sets for symmetric numerical semigroups with embedding dimension three
- Delta sets of numerical monoids are eventually periodic.
- How do you measure primality?
- scientific article; zbMATH DE number 5556006 (Why is no real title available?)
- Numerical semigroups.
- ON DELTA SETS OF NUMERICAL MONOIDS
- On factorization invariants and Hilbert functions
- On the asymptotic behaviour of the number of distinct factorizations into irreducibles
- On the linearity of \(\omega\)-primality in numerical monoids.
- On the set of elasticities in numerical monoids
- Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids.
- Shorter Notes: Redei's Finiteness Theorem for Commutative Semigroups
- The catenary and tame degree of numerical monoids
- The catenary and tame degrees on a numerical monoid are eventually periodic
Cited in
(21)- Symmetry and factorization of numerical sets and monoids
- Delta sets for nonsymmetric numerical semigroups with embedding dimension three
- On divisor-closed submonoids and minimal distances in finitely generated monoids
- An improved algorithm to compute the -primality
- \(\omega \)-primality in arithmetic Leamer monoids
- Delta sets for symmetric numerical semigroups with embedding dimension three
- Factorization length distribution for affine semigroups. I: Numerical semigroups with three generators
- Length density and numerical semigroups
- Factorization invariants in numerical monoids
- scientific article; zbMATH DE number 2185574 (Why is no real title available?)
- scientific article; zbMATH DE number 88945 (Why is no real title available?)
- Factoring in the Chicken McNugget monoid
- Distances between factorizations in the Chicken McNugget monoid
- Approximating length-based invariants in atomic Puiseux monoids
- Factorization invariants of Puiseux monoids generated by geometric sequences
- The computation of factorization invariants for affine semigroups
- Augmented Hilbert series of numerical semigroups
- Numerical semigroups, polyhedra, and posets. III: Minimal presentations and face dimension
- Irreducible unipotent numerical monoids
- On arithmetical numerical monoids with some generators omitted
- The structure theorem for sets of lengths for numerical semigroups
This page was built for publication: On dynamic algorithms for factorization invariants in numerical monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2981784)
