<p>Let <i>M</i> be a cancellative and commutative monoid. A submonoid <i>N</i> of <i>M</i> is called an undermonoid if the Grothendieck groups of <i>M</i> and <i>N</i> coincide. For a given property <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\mathfrak {p}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="fraktur">p</mi> </math></EquationSource> </InlineEquation>, we are interested in providing an answer to the following main question: does it suffice to check that all undermonoids of <i>M</i> satisfy <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\mathfrak {p}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="fraktur">p</mi> </math></EquationSource> </InlineEquation> to conclude that all submonoids of <i>M</i> satisfy <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\mathfrak {p}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="fraktur">p</mi> </math></EquationSource> </InlineEquation>? In this paper, we give a positive answer to this question for the property of being atomic, and then we prove that if <i>M</i> is hereditarily atomic (i.e., every submonoid of <i>M</i> is atomic), then <i>M</i> must satisfy the ACCP, proving a recent conjecture posed by Vulakh and the first author. We also give positive answers to our main question for the following well-studied factorization properties: the bounded factorization property, half-factoriality, and length-factoriality. Finally, we determine all the monoids whose submonoids/undermonoids are half-factorial/length-factorial.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Arithmetic properties encoded in undermonoids

  • Felix Gotti,
  • Bangzheng Li

摘要

Let M be a cancellative and commutative monoid. A submonoid N of M is called an undermonoid if the Grothendieck groups of M and N coincide. For a given property \(\mathfrak {p}\) p , we are interested in providing an answer to the following main question: does it suffice to check that all undermonoids of M satisfy \(\mathfrak {p}\) p to conclude that all submonoids of M satisfy \(\mathfrak {p}\) p ? In this paper, we give a positive answer to this question for the property of being atomic, and then we prove that if M is hereditarily atomic (i.e., every submonoid of M is atomic), then M must satisfy the ACCP, proving a recent conjecture posed by Vulakh and the first author. We also give positive answers to our main question for the following well-studied factorization properties: the bounded factorization property, half-factoriality, and length-factoriality. Finally, we determine all the monoids whose submonoids/undermonoids are half-factorial/length-factorial.