Results 21 to 30 of about 408,425 (278)

THE CYCLIC DECOMPOSITION OF THE FACTOR GROUP CF(Dnh,Z)/R(Dnh) WHEN N IS AN ODD NUMBER

open access: yesJournal of Kufa for Mathematics and Computer, 2010
For fixed positive integer n³3 ,let Dn be the dihedral group, Dnh= Dn ÏC2 and cf(Dnh,Z) be the abelian group of Z-valued class functions of the group Dnh .The intersection of cf(Dnh,Z) with the group of all generalized characters of Dnh , R(Dnh) is a ...
Hussein Hadi Abbas   +1 more
doaj   +1 more source

Brou\'e's abelian defect group conjecture holds for the Harada-Norton sporadic simple group $HN$ [PDF]

open access: yes, 2009
In representation theory of finite groups, there is a well-known and important conjecture due to M. Brou\'e. He conjectures that, for any prime $p$, if a $p$-block $A$ of a finite group $G$ has an abelian defect group $P$, then $A$ and its Brauer ...
Koshitani, Shigeo, Müller, Jürgen
core   +3 more sources

On nilpotent but not abelian groups and abelian but not cyclic groups

open access: yesJournal of Number Theory, 1988
AbstractWe derive asymptotic formulas for A(n) − C(n) = | {m < n: every group of order m is abelian but not every group of order m is cyclic}|, N(n) − A(n) = | {m < n: every group of order m is nilpotent but not every group of order m is abelian}|, and related counting functions from group theory.
Paul Erdös, Michael E. Mays
openaire   +2 more sources

Complementary dual abelian codes in group algebras of some finite abelian groups [PDF]

open access: yesITM Web of Conferences
Linear complementary dual codes have become an interesting sub-family of linear codes over finite fields since they can be practically applied in various fields such as cryptography and quantum error-correction. Recently, properties of complementary dual
Jitman Somphong
doaj   +1 more source

The Abelian Kernel of an Inverse Semigroup

open access: yesMathematics, 2020
The problem of computing the abelian kernel of a finite semigroup was first solved by Delgado describing an algorithm that decides whether a given element of a finite semigroup S belongs to the abelian kernel.
A. Ballester-Bolinches   +1 more
doaj   +1 more source

Automorphisms of abelian group extensions [PDF]

open access: yes, 2009
Let $1 \to N \to G \to H \to 1$ be an abelian extension. The purpose of this paper is to study the problem of extending automorphisms of $N$ and lifting automorphisms of $H$ to certain automorphisms of $G$.Comment: 11 ...
Passi, I. B. S.   +2 more
core   +2 more sources

Degeneracy and decomposability in abelian crossed products [PDF]

open access: yes, 2010
In this paper we study the relationship between degeneracy and decomposability in abelian crossed products. In particular we construct an indecomposable abelian crossed product division algebra of exponent $p$ and index $p^2$ for $p$ an odd prime.
McKinnie, Kelly
core   +2 more sources

Universal abelian groups [PDF]

open access: yesIsrael Journal of Mathematics, 1995
We examine the existence of universal elements in classes of infinite abelian groups. The main method is using group invariants which are defined relative to club guessing sequences. We prove, for example: Theorem: For $n\ge 2$, there is a purely universal separable $p$-group in $\aleph_n$ if, and only if, $\cont\le \aleph_n$.
Menachem Kojman   +3 more
openaire   +3 more sources

Some special classes of n-abelian groups [PDF]

open access: yesInternational Journal of Group Theory, 2012
Let n be an integer. A group G is said to be n-abelian if the map phi_n that sends g to g^n is an endomorphism of G. Then (xy)^n=x^ny^n for all x,y in G, from which it follows [x^n,y]=[x,y]^n=[x,y^n]. It is also easy to see that a group G is n-abelian if
Costantino Delizia, Antonio Tortora
doaj  

On groups and counter automata [PDF]

open access: yes, 2006
We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense of Greibach if and only if it is virtually free abelian of rank n; this ...
Dixon J. D.   +8 more
core   +2 more sources

Home - About - Disclaimer - Privacy