ar X iv : 0 90 5 . 40 48 v 1 [ m at h . G R ] 2 5 M ay 2 00 9 PERFECT COLOURINGS OF CYCLOTOMIC INTEGERS
نویسندگان
چکیده
Perfect colourings of the rings of cyclotomic integers with class number one are studied. It is shown that all colourings induced by ideals (q) are chirally perfect, and vice versa. A necessary and sufficient condition for a colouring to be perfect is obtained, depending on the factorisation of q. This result yields the colour symmetry group H in general. Furthermore, the colour preserving group K is determined in all but finitely many cases. An application to colourings of quasicrystals is given.
منابع مشابه
ar X iv : 0 90 5 . 11 71 v 1 [ m at h . N T ] 8 M ay 2 00 9 Ramification of local fields and Fontaine ’ s property ( P m )
The ramification subgroup of the absolute Galois group of a complete discrete valuation field with perfect residue field is characterized by Fontaine’s property (Pm).
متن کاملar X iv : 0 90 5 . 02 56 v 1 [ m at h . G R ] 3 M ay 2 00 9 REMARKS ON PROFICIENT GROUPS
If a finite group G has a presentation with d generators and r relations, it is well-known that r−d is at least the rank of the Schur multiplier of G; a presentation is called efficient if equality holds. There is an analogous definition for proficient profinite presentations. We show that many perfect groups have proficient presentations. Moreover, we prove that infinitely many alternating gro...
متن کاملar X iv : 0 90 1 . 02 18 v 1 [ m at h . R T ] 2 J an 2 00 9 GRADED SPECHT MODULES
Recently, the first two authors have defined a Z-grading on group algebras of symmetric groups and more generally on the cyclotomic Hecke algebras of type G(l, 1, d). In this paper we explain how to grade Specht modules over these algebras.
متن کاملar X iv : 0 90 5 . 25 85 v 1 [ m at h . C O ] 1 5 M ay 2 00 9 CHARACTERISTIC POINTS OF RECURSIVE SYSTEMS
Characteristic points have been a primary tool in the study of a generating function defined by a single recursive equation. We investigate the proper way to adapt this tool when working with multi-equation recursive systems.
متن کاملar X iv : m at h / 04 11 14 0 v 2 [ m at h . N T ] 4 M ay 2 00 5 THE 3 x + 1 SEMIGROUP
The 3x + 1 semigroup is the multiplicative semigroup S of positive rational numbers generated by { 2k+1 3k+2 : k ≥ 0} together with {2}. This semigroup encodes backwards iteration under the 3x + 1 map, and the 3x + 1 conjecture implies that it contains every positive integer. This semigroup is proved to be the set of positive rationals a b in lowest terms with b 6≡ 0( mod 3), and so contains al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009