Artinian-finitary groups are locally normal-finitary

نویسندگان

چکیده

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

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

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

منابع مشابه

Finitary Permutation Groups

A finitary permutation group is a natural generalization of a finite permutation group. The structure of a transitive finitary permutation group is surprisingly simple when its degree is infinite. Here we study primitivity, following P. M. Neumann’s work in the 1970s. We also study generalized solubility conditions on these groups. These notes arose from lectures aimed at an audience who had se...

متن کامل

homogenous finitary symmetric groups

we characterize strictly diagonal type of embeddings offinitary symmetric groups in terms of cardinality and the characteristic. namely, we prove thefollowing.let $kappa$ be an infinite cardinal. if$g=underset{i=1}{stackrel{infty}bigcup} g_i,$ where $ g_i=fsym(kappa n_i)$,$(h=underset{i=1}{stackrel{infty}bigcup}h_i, $ where $ h_i=alt(kappa n_i) ), $ is a group of strictly diagonal type and$xi=(...

متن کامل

Finitary Power Semigroups of Infinite Groups Are Not Finitely Generated

For a semigroup S the finitary power semigroup of S, denoted Pf (S), consists of all finite subsets of S under the usual multiplication. The main result of this paper asserts that Pf (G) is not finitely generated for any infinite group G.

متن کامل

Finitary Languages

The class of ω-regular languages provides a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually”. Finitary liveness was proposed by Alur and Henzinger as a stronger formulation of liveness [AH98]. It requires that there exists an unknown, fixed bound b...

متن کامل

Finitary Coloring

Suppose that the vertices of Z are assigned random colors via a finitary factor of independent identically distributed (iid) vertex-labels. That is, the color of vertex v is determined by a rule that examines the labels within a finite (but random and perhaps unbounded) distance R of v, and the same rule applies at all vertices. We investigate the tail behavior of R if the coloring is required ...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2005

ISSN: 0021-8693

DOI: 10.1016/j.jalgebra.2005.01.034