Factoring Elementary p-Groups for p ≤ 7

نویسندگان

چکیده

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

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

منابع مشابه

Factoring Elementary p-Groups for p ≤ 7

It is an open problem if an elementary p-group of rank k ≥ 3 does admit full-rank normalized factorization into two of its subsets such that one of the factors has p elements. The paper provides an answer in the p ≤ 7 special case.

متن کامل

Modules for Elementary Abelian p-groups

Let E ∼= (Z/p)r (r ≥ 2) be an elementary abelian p-group and let k be an algebraically closed field of characteristic p. A finite dimensional kE-module M is said to have constant Jordan type if the restriction of M to every cyclic shifted subgroup of kE has the same Jordan canonical form. I shall begin by discussing theorems and conjectures which restrict the possible Jordan canonical form. The...

متن کامل

Elementary abelian p - groups of rank 2 p + 3 are not CI - groups

For every prime p > 2 we exhibit a Cayley graph on Z2p+3 p which is not a CI-graph. This proves that an elementary abelian p-group of rank greater than or equal to 2p+ 3 is not a CI-group. The proof is elementary and uses only multivariate polynomials and basic tools of linear algebra. Moreover, we apply our technique to give a uniform explanation for the recent works of Muzychuk and Spiga conc...

متن کامل

THE SEGAL CONJECTURE FOR ELEMENTARY ABELIAN p-GROUPS-II. p-ADIC COMPLETION IN EQUIVARIANT COHOMOLOGY

This result implies an analogue for general finite groups, but we refer the reader to [25] and especially [S] for that. We shall give as efficient a proof of the theorem as present technology seems to allow, starting from the purely algebraic Ext calculation [4,1.1] of Adams, Gunawardena, and Miller as a given. When G=(Zp)‘, the theorem is due to those authors. However, their original passage f...

متن کامل

Pseudo-Free Families of Finite Computational Elementary Abelian p-Groups

We initiate the study of (weakly) pseudo-free families of computational elementary abelian pgroups, where p is an arbitrary fixed prime. We restrict ourselves to families of computational elementary abelian p-groups Gd such that for every index d, each element of Gd is represented by a single bit string of length polynomial in the length of d. First, we prove that pseudo-freeness and weak pseud...

متن کامل

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


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

ژورنال

عنوان ژورنال: Open Journal of Discrete Mathematics

سال: 2011

ISSN: 2161-7635,2161-7643

DOI: 10.4236/ojdm.2011.11001