zbMATH — the first resource for mathematics

Elasticity in certain block monoids via the Euclidean table. (English) Zbl 1156.20056
The authors compute the irreducibles and elasticities of a basic class of block monoids. Specifically, they consider block monoids over \(\mathbb{Z}_n\) whose support is a two element subset \(\{\overline a,\overline b\}\). Using an earlier result, such monoids are isomorphic to block monoids over \(\mathbb{Z}_n\) restricted to \(\{\overline 1,\overline a\}\), where \(\gcd(a,n)=1\). An algorithm for computing the irreducible blocks is constructed using the concept of a Euclidean table, a variation of the method of continued fractions of {A. Geroldinger} [Colloq. Math. Soc. János Bolyai 51, 723-757 (1987; Zbl 0703.11057)]. This table yields a quick calculation of the elasticity from the Euclidean division algorithm on \(n\) and \(a\), avoiding any consideration of the irreducibles in the monoid. Lastly, the authors work through some computational bounds for the set of all possible elasticities as \(a\) varies and \(n=p\) remains a fixed prime number.

20M14 Commutative semigroups
11R27 Units and factorization
11J70 Continued fractions and generalizations
11A55 Continued fractions
13A05 Divisibility and factorizations in commutative rings
13F05 Dedekind, Prüfer, Krull and Mori rings and their generalizations
11B83 Special sequences and polynomials
Full Text: DOI EuDML
[1] ANDERSON D. F.: Elasticity of factorizations in integral domains: a survey. Lecture Notes in Pure and Appl. Math. 189, Marcel Dekker, New York, 1997, pp. 1-30. · Zbl 0903.13008
[2] ANDERSON D. F.-CHAPMAN S. T.: On the elasticities of Krull domains with finite cyclic divisor class group. Comm. Algebra 28 (2000), 2543-2553. · Zbl 0964.13001
[3] BAGINSKI P.-CHAPMAN S. T.-HOLDEN M.-MOORE T.: Asymptotic elasticity in atomic monoids. Semigroup Forum 72 (2006), 134-142. · Zbl 1099.20033
[4] CHAPMAN S. T.-GEROLDINGER A.: On cross numbers of minimal zero sequences. Australas. J. Comb. 14 (1996), 85-92. · Zbl 0866.11018
[5] CHAPMAN S. T.-GEROLDINGER A.: Krull domains and monoids, their sets of lengths and associated combinatorial problems. Lecture Notes in Pure and Appl Math. 189, Marcel Dekker, New York, 1997, pp. 73-112. · Zbl 0897.13001
[6] CHAPMAN S. T.-SMITH W. W.: An Analysis using the Zaks-Skula constant of element factorizations in Dedekind domains. J. Algebra 159 (1993), 176-190. · Zbl 0784.11050
[7] CHAPMAN S. T.-SMITH W. W.: On factorization in block monoids formed by \(\{\overline 1,\overline a\)\( in \)\mathbb Z_n\(. Proc. Edinb. Math. Soc. (2) 46 (2003), 257-267.\) · Zbl 1065.20072
[8] GEROLDINGER A.: On non-unique factorizations into irreducible elements II. Colloq Math. Soc. Janos Bolyai 51 (1987), 723-757.
[9] GEROLDINGER A.-HALTER-KOCH F.: Nonunique factorizations in block semi-groups and their arithmetical applications. Math. Slovaca 42 (1992), 641-661. · Zbl 0765.11045
[10] GEROLDINGER A.-HALTER-KOCH F.: Non-unique Factorizations. Algebraic Combinatorial and Analytic Theory, Pure and Applied Mathematics. Vol. 278, Chapman & Hall/CRC, Boca Raton, FL, 2006. · Zbl 1113.11002
[11] HALTER-KOCH F.: Elasticity of factorizations in atomic monoids and integral domains. J. Theor. Nombres Bordeaux 7 (1995), 367-385. · Zbl 0844.11068
[12] KATTCHEE K. M.: On Factorization in Krull domains with divisor class group \(Z_{2^k},\). Arithmetical Properties of Commutative Rings and Monoids, Chapman & Hall CRC, Boca Raton, FL, 2005, pp. 325-336. · Zbl 1099.13031
[13] OLDS C. D.: Continued Fractions. New Mathematical Library 9, Random House Inc., New York, 1961. · Zbl 0123.25804
[14] SCHMID W. A.: Arithmetic of block monoids. Math. Slovaca 54 (2004), 503-526. · Zbl 1108.11084
[15] SCHMID W. A.: On invariants related to non-unique factorizations in block monoids and rings of algebraic integers. Math. Slovaca 55 (2005), 21-37. · Zbl 1108.11074
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.