\(\omega \)-primality in arithmetic Leamer monoids
type: Item
instance of: scholarly article
title: \(\omega \)-primality in arithmetic Leamer monoids
zbMATH Open document ID: 1475.13033
author: Z. Tripp
author: Scott T. Chapman
published in: Semigroup Forum
publication date: 2019-07-16T00:00:00Z
review text: The paper under review studies \(\omega\)-primality for Leamer monoids. For an additive monoid \(S\) and some \(x \in S\), not a unit, one defines \(\omega(x)\) as the smallest \(m\) such that whenever \(x\) divides \(x_1 + \dots +x_k\) with \(x_i\in S\) there is a subset \(I\) of \(\{1, \dots, k\}\) of at most \(m\) elements such that \(x\) divides \(\sum_{i\in I}x_i\). If \(x\) is a prime element, then \(\omega(x)=1\). In a way the \(\omega\)-function allows to quantify how far an element is from being prime. A numerical semigroup \(\Gamma\) is a submonoid of \((\mathbb{N}, +)\) with finite complement. For \(s \in \mathbb{N} \setminus \Gamma\) one defines \(S_{\Gamma}^s = \{(0,0)\} \cup \{(x,n) \colon \{x, x+s, x+2s, \dots, x+ns\} \subset \Gamma\} \subset \mathbb{N}^2\). This is a monoid called a Leamer monoid. The authors study the \(\omega\)-function for Leamer monoids, and more specifically Leamer monoids for \(\Gamma\) being generated by an arithmetical progression. In this case exact results are obtained.
reviewed by: Wolfgang A. Schmid
Mathematics Subject Classification ID: 13F15
Mathematics Subject Classification ID: 20M13
zbMATH DE Number: 7080903
zbMATH Keywords: numerical monoid
zbMATH Keywords: Leamer monoid
zbMATH Keywords: omega function
zbMATH Keywords: non-unique factorization
MaRDI profile type: Publication
full work available at URL: s00233-019-10036-x
OpenAlex ID: W2952357362
cites work: HOW FAR IS AN ELEMENT FROM BEING PRIME?
cites work: An algorithm to compute \(\omega\)-primality in a numerical monoid.
cites work: On dynamic algorithms for factorization invariants in numerical monoids
cites work: ON DELTA SETS OF NUMERICAL MONOIDS
cites work: THE CATENARY AND TAME DEGREES ON A NUMERICAL MONOID ARE EVENTUALLY PERIODIC
cites work: The catenary and tame degree of numerical monoids
cites work: Measuring primality in numerical semigroups with embedding dimension three.
cites work: On the omega values of generators of embedding dimension-three numerical monoids generated by an interval
cites work: Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.
cites work: Huneke-Wiegand conjecture for complete intersection numerical semigroup rings.
cites work: Numerical semigroups.
cites work: Factorization properties of Leamer monoids.
cites work: On Numerical Semigroups Generated by Generalized Arithmetic Sequences
cites work: On factorization invariants and Hilbert functions
cites work: On the linearity of \(\omega\)-primality in numerical monoids.
cites work: How Do You Measure Primality?
cites work: Factorization invariants in numerical monoids
DOI: 10.1007/S00233-019-10036-X
Recommended article: On the linearity of \(\omega\)-primality in numerical monoids.
Recommended article: Q4368831
Recommended article: Q4534306
Recommended article: An algorithm to compute \(\omega\)-primality in a numerical monoid.
Recommended article: On the arithmetic of strongly primary monoids.
Recommended article: Arithmetical theory of monoid homomorphisms
Recommended article: PRME AND k-PRIME IDEALS IN Ω-GROUPS
Recommended article: О количестве простых элементов в некоторых моноидах натуральных чисел
Recommended article: Q4948331
Recommended article: Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.
description: scientific article; zbMATH DE number 7080903