On the asymptotic behaviour of the number of distinct factorizations into irreducibles (Q1320532): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Length Functions on Integral Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic behaviour of lengths of factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation theorem for semigroups with divisor theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finiteness theorems for factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4771385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5612629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimension and multiplicity for graded algebras / rank
 
Normal rank

Latest revision as of 13:53, 22 May 2024

scientific article
Language Label Description Also known as
English
On the asymptotic behaviour of the number of distinct factorizations into irreducibles
scientific article

    Statements

    On the asymptotic behaviour of the number of distinct factorizations into irreducibles (English)
    0 references
    0 references
    24 April 1994
    0 references
    A commutative semigroup \(H\) with cancellation and a unit element is called an FF-monoid (finite factorization monoid), provided the number \(f(a)\) of essentially distinct (i.e. up to invertible factors and permutations) factorizations of any \(a\in H\) satisfies \(1\leq f(a)< \infty\). It is proved that if the number of essentially distinct irreducibles dividing some power of \(a\in H\) is finite then \(f(a^ n)= An^{r-1}+ O(n^{r-2})\) holds with a certain \(A>0\) and a suitable explicitly given \(r=r(a)\). This result has interesting applications to the study of the number of distinct factorizations in algebraic number fields.
    0 references
    integral domains
    0 references
    Krull domains
    0 references
    finite factorization monoid
    0 references
    factorizations
    0 references

    Identifiers

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