Erdős-Zaks all divisor sets.

DOI10.1007/s10998-012-5026-6zbMath1263.20056OpenAlexW2057210245MaRDI QIDQ452841

William W. Smith, Scott Thomas Chapman

Publication date: 17 September 2012

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10998-012-5026-6

zbMATH Keywords

algorithmsatomsnon-unique factorizationsblock monoidscross numbersErdős-Zaks all divisor setsEZADSsplittable setsweakly half-factorial monoids

Mathematics Subject Classification ID

Units and factorization (11R27) Free semigroups, generators and relations, word problems (20M05) Other combinatorial number theory (11B75) Finite abelian groups (20K01) Commutative rings defined by factorization properties (e.g., atomic, factorial, half-factorial) (13F15) Arithmetic theory of semigroups (20M13)

Related Items

EZADS inputs which produce half-factorial block monoids.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reducible sums and splittable sets
• Factorization in Dedekind domains with finite class group
• Half-factorial-domains
• On the maximal cardinality of half-factorial sets in cyclic groups
• Remarks on factorizations in algebraic number fields
• On the hfd, chfd, and k-hfd properties in dedekind domains
• On c-semigroups
• Half factorial domains
• Weakly half-factorial sets in finite abelian groups