Factorization and catenary degree in 3-generated numerical semigroups
From MaRDI portal
Publication:2851456
DOI10.1016/j.endm.2009.07.026zbMath1273.05082OpenAlexW2074430937MaRDI QIDQ2851456
F. Aguiló-Gost, Pedro A. García Sánchez
Publication date: 10 October 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.026
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (5)
Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids. ⋮ THE CATENARY AND TAME DEGREES ON A NUMERICAL MONOID ARE EVENTUALLY PERIODIC ⋮ Unnamed Item ⋮ The maximal denumerant of a numerical semigroup. ⋮ Distances between Factorizations in the Chicken McNugget Monoid
Uses Software
Cites Work
This page was built for publication: Factorization and catenary degree in 3-generated numerical semigroups