Achievement and avoidance games for generating abelian groups

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

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

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

منابع مشابه

Achievement and Avoidance Games for Generating Abelian Groups

A b s t r a c t : For any finite group G, the DO GENERATE game is played by two players Alpha and Beta as follows. Alpha moves first and chooses x 1 C G. The k-th play consists o f a choice of x g E G S k _ 1 where S n = ~x 1 . . . . . X n } . Let G n = . The game ends when G n = G. The player who moves x n wins. In the corresponding avoidance game, DON'T GENERATE, the last player to move l...

متن کامل

Impartial achievement games for generating generalized dihedral groups

We study an impartial game introduced by Anderson and Harary. This game is played by two players who alternately choose previously-unselected elements of a finite group. The first player who builds a generating set from the jointly-selected elements wins. We determine the nimnumbers of this game for generalized dihedral groups, which are of the form Dih(A) = Z2 n A for a finite abelian group A.

متن کامل

non-divisibility for abelian groups

Throughout all groups are abelian. We say a group G is n-divisible if nG = G. If G has no non-zero n-divisible subgroups for all n>1 then we say that G is absolutely non-divisible. In the study of class C consisting   all absolutely non-divisible groups such as G, we come across the sub groups T_p(G) = the sum of all p-divisible subgroups and rad_p(G) = the intersection of all p^nG. The proper...

متن کامل

Generating random elements of abelian groups

Algorithms based on rapidly mixing Markov chains are discussed to produce nearly uniformly distributed random elements in abelian groups of finite order. Let A be an abelian group generated by set S. Then one can generate ε-nearly uniform random elements of A using 4|S| log(|A| /ε) log(|A|) additions and the same number of random bits.

متن کامل

Quantum Error-Correction Codes on Abelian Groups

We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.

متن کامل

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


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

ژورنال

عنوان ژورنال: International Journal of Game Theory

سال: 1987

ISSN: 0020-7276,1432-1270

DOI: 10.1007/bf01756028