ARITHMETICAL CHARACTERIZATION OF CLASS GROUPS OF THE FORM Z/nZ ⊕ Z/nZ VIA THE SYSTEM OF SETS OF LENGTHS

نویسنده

  • WOLFGANG A. SCHMID
چکیده

Let H be a Krull monoid with finite class group such that each class contains a prime divisor (e.g., the multiplicative monoid of the ring of algebraic integers of some number field). It is shown that it can be determined whether the class group is of the form Z/nZ ⊕ Z/nZ, for n ≥ 3, just by considering the system of sets of lengths of H.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arithmetical Congruence Preservation: From Finite to Infinite

Various problems on integers lead to the class of functions defined on a ring of numbers (or a subset of such a rings) METTRE RING AU SINGULIER and verifying a − b divides f(a) − f(b) for all a, b. We say that such functions are “congruence preserving”. In previous works, we characterized these classes of functions for the cases N → Z, Z→ Z and Z/nZ→ Z/mZ in terms of sums series of rational pol...

متن کامل

Iranian natural zeolite particle modification: Green synthesis, characterization, and oil spill remediation

In the present work, Iranian natural zeolite particles (NZ) as an abundant and low-cost resource were modified by chemical covalent attachments of commercially available stearic acid (SA) with tunable hydrophobic/hydrophilic properties. The versatile, simple, and green technique of mechanogriding was performed for the hydrophobic derivatisation of NZ. The NZ and as-prepared modified particles w...

متن کامل

Counting Sets With Small Sumset, And The Clique Number Of Random Cayley Graphs

Given a set A ⊆ Z/NZ we may form a Cayley sum graph GA on vertex set Z/NZ by joining i to j if and only if i + j ∈ A. We investigate the extent to which performing this construction with a random set A simulates the generation of a random graph, proving that the clique number of GA is a.s. O(logN). This shows that Cayley sum graphs can furnish good examples of Ramsey graphs. To prove this resul...

متن کامل

Math 561 H Fall 2011 Homework 3 Solutions Drew

Proof. Suppose that φ; Z/nZ → Z/nZ is an automorphism with φ(1) = a. By the homomorphism property we have φ(x) = φ(1 + · · · + 1) = φ(1) + · · · + φ(1) = a + · · · + a = ax. Thus the image of φ is the (additive) cyclic subgroup 〈a〉 ≤ Z/nZ. Then since φ is surjective we must have 〈a〉 = Z/nZ. By the Lemma, this happens if and only if a and n are coprime, i.e. a ∈ (Z/nZ)×, in which case the map φ(...

متن کامل

ON ZERO-SUM SEQUENCES IN Z/nZ⊕ Z/nZ

It is well known that the maximal possible length of a minimal zero-sum sequence S in the group Z/nZ⊕Z/nZ equals 2n−1, and we investigate the structure of such sequences. We say that some integer n ≥ 2 has Property B, if every minimal zero-sum sequence S in Z/nZ⊕Z/nZ with length 2n− 1 contains some element with multiplicity n− 1. If some n ≥ 2 has Property B, then the structure of such sequence...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008