Wyniki wyszukiwania

1

Chains of factorizations in weakly Krull domains

100%

Geroldinger A.

Colloquium Mathematicum

|

1997

|

tom 72

|

nr 1

53-81

2

Chains of factorizations in orders of global fields

100%

Geroldinger A.

Colloquium Mathematicum

|

1997

|

tom 72

|

nr 1

83-102

3

A structure theorem for sets of lengths

100%

Geroldinger A.

Colloquium Mathematicum

|

1998

|

tom 78

|

nr 2

225-259

4

The set of minimal distances in Krull monoids

64%

Geroldinger A., Zhong Q.

Acta Arithmetica

|

2016

|

tom 173

|

nr 2

97-120

EN

Let H be a Krull monoid with class group G. Then every nonunit a ∈ H can be written as a finite product of atoms, say $a= u_1 · ... · u_k$. The set 𝖫(a) of all possible factorization lengths k is called the set of lengths of a. If G is finite, then there is a constant M ∈ ℕ such that all sets of lengths are almost arithmetical multiprogressions with bound M and with difference d ∈ Δ*(H), where Δ*(H) denotes the set of minimal distances of H. We show that max Δ*(H) ≤ max{exp(G)-2,𝗋(G)-1} and that equality holds if every class of G contains a prime divisor, which holds true for holomorphy rings in global fields.

5

Congruence monoids

64%

Geroldinger A., Halter-Koch F.

Acta Arithmetica

|

2004

|

tom 112

|

nr 3

263-296

6

Inverse zero-sum problems {III}

51%

Gao W., Geroldinger A., Grynkiewicz D.

Acta Arithmetica

|

2010

|

tom 141

|

nr 2

103-152

7

Inverse zero-sum problems

51%

Gao W., Geroldinger A., Schmid W.

Acta Arithmetica

|

2007

|

tom 128

|

nr 3

245-279

Ograniczanie wyników

4 Acta Arithmetica

3 Colloquium Mathematicum

7 Geroldinger A.

2 Gao W.

1 Grynkiewicz D.

1 Halter-Koch F.

1 Schmid W.

1 Zhong Q.

1 2016

1 2010

1 2007

1 2004

1 1998

2 1997

Chains of factorizations in weakly Krull domains

Chains of factorizations in orders of global fields

A structure theorem for sets of lengths

The set of minimal distances in Krull monoids

Congruence monoids

Inverse zero-sum problems {III}

Inverse zero-sum problems