A factorization formula for class number two
From MaRDI portal
The authors study the (additive) monoid \(X_n\), consisting of all \((x_1,\dots,x_{n+1}) \in \mathbb N_0^{n+1}\) such that \(x_1 + \dots + x_n = 2x_{n+1}\). It is a Krull monoid with class number \(2\) and \(n\) prime divisors in the non-principal class. A recursion formula for the number of essentially distinct factorizations of an element in \(X_n\) is derived.
Recommendations
- Factorization problems in class number two
- ON FACTORIZATION IN BLOCK MONOIDS FORMED BY $\{\bar{1},\bar{a}\}$ IN $\mathbb{Z}_{n}$
- Arithmetical characterization of class groups of the form \(\mathbb Z/n\mathbb Z\oplus\mathbb Z/n\mathbb Z\) via the system of sets of lengths.
- A characterization of class groups via sets of lengths. II.
- Monoids determined by a homogeneous linear Diophantine equation and the half-factorial property
Cites work
- A Characterization of Algebraic Number Fields with Class Number Two
- Factorization problems in class number two
- scientific article; zbMATH DE number 54991 (Why is no real title available?)
- scientific article; zbMATH DE number 1031234 (Why is no real title available?)
- scientific article; zbMATH DE number 1031236 (Why is no real title available?)
- Monoids determined by a homogeneous linear Diophantine equation and the half-factorial property
- Number fields
- Numbers with unique factorization in an algebraic number field
- On the asymptotic behaviour of the number of distinct factorizations into irreducibles
Cited in
(5)
This page was built for publication: A factorization formula for class number two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961092)
