نتایج جستجو برای: n abelian groups

تعداد نتایج: 1595211  

Journal: :Electr. J. Comb. 2013
David Clark Vladimir D. Tonchev

A complete enumeration of relative difference sets (RDS) with parameters (16, 4, 16, 4) in a group of order 64 with a normal subgroup N of order 4 is given. If N = Z4, three of the eleven abelian groups of order 64, and 23 of the 256 nonabelian groups of order 64 contain (16, 4, 16, 4) RDSs. If N = Z2 × Z2, six of the abelian groups and 194 of the non-abelian groups of order 64 contain (16, 4, ...

Journal: :Ann. Pure Appl. Logic 2010
Samuel Coskey

Greg Hjorth and Simon Thomas proved that the classification problem for torsion-free abelian groups of finite rank strictly increases in complexity with the rank. Subsequently, Thomas proved that the complexity of the classification problems for p-local torsion-free abelian groups of fixed rank n are pairwise incomparable as p varies. We prove that if 3 ≤ m < n and p, q are distinct primes, the...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشکده علوم پایه 1388

چکیده ندارد.

H. Doostie

A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...

Journal: :journal of sciences, islamic republic of iran 2009
h. doostie

a non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized fibonacci sequence , , , . a remarkable application of this definition may be find on the study of random covers in the cryptography. the 2-step generalized sequences for the dihedral groups studied for their pe...

Journal: :J. Comput. Syst. Sci. 2007
Telikepalli Kavitha

We consider the problem of determining if two finite groups are isomorphic. The groups are assumed to be represented by their multiplication tables. We present an O(n) algorithm that determines if two Abelian groups with n elements each are isomorphic. This improves upon the previous upper bound of O(n log n) [23] known for this problem. We solve a more general problem of computing the orders o...

Let $G$ be a finite non-abelian $p$-group and $L(G)$ denotes the absolute center of $G$. Also, let $Aut^{L}(G)$ and $Aut_c(G)$ denote the group of all absolute central and the class preserving automorphisms of $G$, respectively. In this paper, we give a necessary and sufficient condition for $G$ such that $Aut_c(G)=Aut^{L}(G)$. We also characterize all finite non-abelian $p$-groups of order $p^...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شهید باهنر کرمان - دانشکده ریاضی و کامپیوتر 1383

چکیده ندارد.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید