An Overview of the Computational Aspects of Nonunique Factorization Invariants

DOI10.1007/978-3-319-38855-7_7zbMath1394.20034arXiv1504.07424OpenAlexW1550656971MaRDI QIDQ2826742

Pedro A. García Sánchez

Publication date: 18 October 2016

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.07424

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Commutative semigroups (20M14) Software, source code, etc. for problems pertaining to group theory (20-04) Divisibility and factorizations in commutative rings (13A05) Arithmetic theory of semigroups (20M13)

Related Items (16)

Factorization invariants of the additive structure of exponential Puiseux semirings ⋮ Sets of Lengths ⋮ CRITICAL BINOMIAL IDEALS OF NORTHCOTT TYPE ⋮ Delta sets for nonsymmetric numerical semigroups with embedding dimension three ⋮ Numerical semigroups, polyhedra, and posets. III: Minimal presentations and face dimension ⋮ Minimal presentations of shifted numerical monoids ⋮ The computation of factorization invariants for affine semigroups ⋮ Factorization invariants in numerical monoids ⋮ On strongly primary monoids, with a focus on Puiseux monoids ⋮ On strongly primary monoids and domains ⋮ Factorization length distribution for affine semigroups. II: Asymptotic behavior for numerical semigroups with arbitrarily many generators ⋮ Isolated factorizations and their applications in simplicial affine semigroups ⋮ Approximating length-based invariants in atomic Puiseux monoids ⋮ On factorization invariants and Hilbert functions ⋮ A realization theorem for sets of lengths in numerical monoids ⋮ Factorization theory in commutative monoids

Uses Software

• GAP
• homalg
• Normaliz
• numericalsgps
• SINGULAR
• 4ti2
• singular
• 4ti2gap
• 4ti2interface
• NormalizInterface

Cites Work

• Unnamed Item
• Unnamed Item
• Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids.
• A characterization of arithmetical invariants by the monoid of relations.
• Delta sets of numerical monoids are eventually periodic.
• Numerical semigroups.
• An efficient incremental algorithm for solving systems of linear diophantine equations
• Atomic commutative monoids and their elasticity.
• Minimal presentations for monoids with the ascending chain condition on principal ideals.
• Binomial ideals
• On the delta set and the Betti elements of a BF-monoid.
• The maximal denumerant of a numerical semigroup.
• A characterization of arithmetical invariants by the monoid of relations. II: The monotone catenary degree and applications to semigroup rings.
• The catenary and tame degree in finitely generated commutative cancellative monoids.
• Generators and relations of abelian semigroups and semigroup rings
• Elasticity of factorization in number fields
• THE CATENARY AND TAME DEGREES ON A NUMERICAL MONOID ARE EVENTUALLY PERIODIC
• Elements in a Numerical Semigroup with Factorizations of the Same Length
• The catenary and tame degree of numerical monoids
• Half factorial domains
• Irreducible ideals of finitely generated commutative monoids

This page was built for publication: An Overview of the Computational Aspects of Nonunique Factorization Invariants