Length density and numerical semigroups

DOI10.1007/978-3-031-10796-2_3MaRDI QIDQ6380861arXivFDO

Authors Cole Brower, Scott T. Chapman, Travis Kulhanek, J. M. Mcdonough, Christopher O'Neill, Vody Pavlyuk, Vadim Ponomarenko

Publication date 20 October 2021

Published in arXiv

Full work available at URL https://doi.org/10.1007/978-3-031-10796-2_3

Mathematics Subject Classification ID

The Frobenius problem (11D07) Free semigroups, generators and relations, word problems (20M05) Arithmetic theory of semigroups (20M13) Commutative semigroups (20M14)

arXiv classification

math.AC

Abstract: Length density is a recently introduced factorization invariant, assigned to each element $n$ of a cancellative commutative atomic semigroup $S$, that measures how far the set of factorization lengths of $n$ is from being a full interval. We examine length density of elements of numerical semigroups (that is, additive subsemigroups of the non-negative integers).

This page was built for publication: Length density and numerical semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6380861)