Inertial Automorphisms of an Abelian Group

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Automorphisms of Order 2 of an Abelian Group.

2 "The Foundations of the Calculus of Variations in the Large in m-Space. (First paper.) Trans. Am. Math. Soc., 31 (1930). Lemma § 7, p. 385. Lemma 2 of p. 387 should read, "Let D (x) be a determinant whose n columns are n conjugate, etc." The error in the proof in § 7 was first called to my attention by G. A. Bliss. The proof given in § 7 can be modified so as to be correct but the present pro...

متن کامل

On the Fixed Points of Abelian Group Automorphisms

In this article, we present general properties of xed-point groups of the automorphisms of nite groups. Speci cally, we determine the form of xed-point groups and partition Aut(G) according to the number of xed points possessed by each automorphism. A function θ records the size of each partitioning set; we nd properties for θ in general and develop formulae for θ with respect to certain classe...

متن کامل

Necessity of Fermion grading symmetry for automorphisms that commute with an arbitrary asymptotically abelian group of automorphisms

Let γ be an automorphism of a fermion-boson C∗-system. If γ commutes with an arbitrary asymptotically abelian group of automorphisms, then it preserves the fermion grading symmetry.

متن کامل

Automorphisms of Finite Abelian Groups

Much less known, however, is that there is a description of Aut(G), the automorphism group of G. The first compete characterization that we are aware of is contained in a paper by Ranum [1] near the turn of the last century. Beyond this, however, there are few other expositions. Our goal is to fill this gap, thereby providing a much needed accessible and modern treatment. Our characterization o...

متن کامل

Computing automorphisms of abelian number fields

Let L = Q(α) be an abelian number field of degree n. Most algorithms for computing the lattice of subfields of L require the computation of all the conjugates of α. This is usually achieved by factoring the minimal polynomial mα(x) of α over L. In practice, the existing algorithms for factoring polynomials over algebraic number fields can handle only problems of moderate size. In this paper we ...

متن کامل

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


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

ژورنال

عنوان ژورنال: Rendiconti del Seminario Matematico della Università di Padova

سال: 2012

ISSN: 0041-8994

DOI: 10.4171/rsmup/127-11