algorithmsatomsblock monoidscross numbersErdős-Zaks all divisor setsEZADSnon-unique factorizationssplittable setsweakly half-factorial monoids
Other combinatorial number theory (11B75) Units and factorization (11R27) Commutative rings defined by factorization properties (e.g., atomic, factorial, half-factorial) (13F15) Finite abelian groups (20K01) Free semigroups, generators and relations, word problems (20M05) Arithmetic theory of semigroups (20M13)
Let \(G\) be an Abelian group, and \(S\) be a subset of \(G\). Let \(\mathfrak F(G,S)\) be the free Abelian group with basis \(S\), and \(\sigma\colon\mathfrak F(G,S)\to G\) be the monoid homomorphism mapping each element of \(S\) to itself. The block monoid \(\mathfrak B(G,S)\) is defined as \(\ker\sigma\). The authors study factorization properties of the monoid \(\mathfrak B(G,S)\), where \(G\) is a finite cyclic group. An all divisor set in \(\mathbb Z_n\) is a subset of \(\mathbb Z_n\) containing \(1\) such that the least residues of the elements in \(S\) are divisors of \(n\) in \(\mathbb Z\). Using Erdős-Zaks' work, the authors develop an algorithm that starts with an `EZADS' input (see title), and leads to a list of blocks which include all the non-primary irreducible blocks in \(\mathfrak B(\mathbb Z_q,S)\): here \(q\) is a positive integer, and \(S\) is an all divisor set (called an EZADS), both of them obtained from the EZADS input. The authors characterize the atoms in the list of blocks. They prove that the block monoid \(\mathfrak B(\mathbb Z_q,S)\) is weakly half-factorial, and obtain a criterion for half-factoriality of \(\mathfrak B(\mathbb Z_q,S)\) using the above mentioned list of blocks. Further results and numerical examples are included.
- EZADS inputs which produce half-factorial block monoids.
- On large half-factorial sets in elementary p-groups: maximal cardinality and structural char\-ac\-ter\-i\-zation.
- scientific article; zbMATH DE number 2185567
- ON FACTORIZATION IN BLOCK MONOIDS FORMED BY $\{\bar{1},\bar{a}\}$ IN $\mathbb{Z}_{n}$
- Weakly half-factorial sets in finite abelian groups
- Factorization in Dedekind domains with finite class group
- Half factorial domains
- Half-factorial-domains
- scientific article; zbMATH DE number 3475558 (Why is no real title available?)
- scientific article; zbMATH DE number 907874 (Why is no real title available?)
- Non-unique factorizations. Algebraic, combinatorial and analytic theory
- On c-semigroups
- On the hfd, chfd, and k-hfd properties in dedekind domains
- On the maximal cardinality of half-factorial sets in cyclic groups
- Quasi-half-factorial subsets of Abelian torsion groups.
- Reducible sums and splittable sets
- Remarks on factorizations in algebraic number fields
- Weakly half-factorial sets in finite abelian groups
This page was built for publication: Erdős-Zaks all divisor sets.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452841)
