Lengths of irreducible factorizations in fields with small class number
Daisy C. McCoy, Charles J. Parry (1990)
Colloquium Mathematicae
Similarity:
Daisy C. McCoy, Charles J. Parry (1990)
Colloquium Mathematicae
Similarity:
J. Kaczorowski (1981)
Colloquium Mathematicae
Similarity:
A. Geroldinger (1991)
Acta Arithmetica
Similarity:
C. R. Fletcher (1971)
Publications du Département de mathématiques (Lyon)
Similarity:
W. Narkiewicz (1973)
Colloquium Mathematicae
Similarity:
G. Lettl (1987)
Colloquium Mathematicae
Similarity:
Jerzy Kaczorowski (1983)
Acta Arithmetica
Similarity:
Conway, J.H. (1998)
Journal of Integer Sequences [electronic only]
Similarity:
B. Jónsson (1966)
Colloquium Mathematicae
Similarity:
A. Błaszczyk (1973)
Colloquium Mathematicae
Similarity:
Chistov, A.L. (2005)
Zapiski Nauchnykh Seminarov POMI
Similarity:
Jason Greene Boynton (2012)
Colloquium Mathematicae
Similarity:
Let D be an integral domain with field of fractions K. In this article, we use a certain pullback construction in the spirit of Int(E,D) that furnishes many examples of domains between D[x] and K[x] in which there are elements that do not admit a finite factorization into irreducible elements. We also define the notion of a fixed divisor for this pullback construction to characterize all of its irreducible elements and those nonzero nonunits that do admit a finite factorization into...
W. Narkiewicz (1966)
Colloquium Mathematicae
Similarity:
Henry B. Fine (1891/92)
Bulletin of the New York Mathematical Society
Similarity:
Ruangsinsap, Pattira, Laohakosol, Vichian, Udomkavanich, Pattanee (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Narkiewicz, Władysław, Ruengsinsub, Pattira, Laohakosol, Vichian (2004)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Maciej Radziejewski, Wolfgang A. Schmid (2005)
Colloquium Mathematicae
Similarity:
The investigation of certain counting functions of elements with given factorization properties in the ring of integers of an algebraic number field gives rise to combinatorial problems in the class group. In this paper a constant arising from the investigation of the number of algebraic integers with factorizations of at most k different lengths is investigated. It is shown that this constant is positive if k is greater than 1 and that it is also positive if k equals 1 and the class...
P. Mihók, R. Vasky (1995)
Discussiones Mathematicae Graph Theory
Similarity:
A hereditary property R of graphs is said to be reducible if there exist hereditary properties P₁,P₂ such that G ∈ R if and only if the set of vertices of G can be partitioned into V(G) = V₁∪V₂ so that ⟨V₁⟩ ∈ P₁ and ⟨V₂⟩ ∈ P₂. The problem of the factorization of reducible properties into irreducible factors is investigated.