On the incomparability of systems of sets of lengths (Q6116409)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7713621
Language Label Description Also known as
default for all languages
No label defined
    English
    On the incomparability of systems of sets of lengths
    scientific article; zbMATH DE number 7713621

      Statements

      On the incomparability of systems of sets of lengths (English)
      0 references
      0 references
      0 references
      18 July 2023
      0 references
      All monoids considered in the paper are commutative and cancellative. A monoid homomorphism \(\varphi : H\to G\) is called a divisor homomorphism, if for all \( a, b \in H\) \( \varphi (a)| \varphi (b)\) implies that \(a | b \). A monoid \(H\) is called a Krull monoid if it admits a divisor homomorphism into a free abelian monoid. Below the abstract to the paper is quoted. ``Let \(H\) be a Krull monoid with finite class group \(G\) such that every class contains a prime divisor. We consider the system \(\mathcal{L}(H) \) of all sets of lengths of \( H\) and study when \(\mathcal{L}(H) \) contains or is contained in a system \(\mathcal{L}(H ') \) of a Krull monoid \(H'\) with finite class group \(G'\), prime divisors in all classes and Davenport constant \(\mathrm {D}(G') = \mathrm {D}(G)\). Among others, we show that if \(G\) is either cyclic of order \( m \geq 7\) or an elementary 2-group of rank \(m-1 \geq 6\), and \(G'\) is any group which is non-isomorphic to \(G\) but with Davenport constant \(\mathrm {D}(G') = \mathrm {D}(G)\), then the systems \(\mathcal{L}(H) \) and \(\mathcal{L}(H ') \) are incomparable.''
      0 references
      monoids
      0 references
      domains
      0 references
      Krull monoid
      0 references
      class group
      0 references
      divisor homomorphisms
      0 references
      sets of lengths
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references