Results 31 to 40 of about 2,666 (229)

A Simple Classification of Finite Groups of Order p2q2 [PDF]

open access: yesMathematics Interdisciplinary Research, 2018
‎Suppose G is a group of order p2q2 where p>q are prime numbers and suppose P and Q are Sylow p-subgroups and Sylow q-subgroups of G, ‎respectively‎. ‎In this paper‎, ‎we show that up to isomorphism‎, ‎there are four groups of order p2q2 when Q and P are
Aziz Seyyed Hadi   +2 more
doaj   +1 more source

A Note on Additive Groups of Some Specific Torsion-Free Rings of Rank Three and Mixed Associative Rings

open access: yesDiscussiones Mathematicae - General Algebra and Applications, 2017
It is studied how rank two pure subgroups of a torsion-free Abelian group of rank three influences its structure and type set. In particular, the criterion for such a subgroup B to be a direct summand of a torsion-free Abelian group of rank three with ...
Najafizadeh Alireza, Woronowicz Mateusz
doaj   +1 more source

Green’s relations for 2 × 2 matrices over linearly ordered abelian groups [PDF]

open access: yesProceedings of the Estonian Academy of Sciences
We consider semigroups of 2 × 2 matrices over linearly ordered abelian groups with respect to multiplication, which is defined similarly to tropical algebra. We study Green’s relations on such semigroups.
Marilyn Kutti, Valdis Laan
doaj   +1 more source

Semi-Extraspecial Groups with an Abelian Subgroup of Maximal Possible Order [PDF]

open access: yesAdvances in Group Theory and Applications, 2018
Let p be a prime. A finite p-group G is defined to be semi-extraspecial if for every maximal subgroup N in Z(G) the quotient G/N is a an extraspecial group. In addition, we say that G is ultraspecial if G is semi-extraspecial and |G : G′| = |G′|^2.
Mark L. Lewis
doaj   +1 more source

Abelian Groups that are unions of proper subgroups [PDF]

open access: yesBulletin of the Australian Mathematical Society, 1992
The abelian groups that can be written as a union of proper subgroups are characterised, all the ways that this can be done for a given group are indicated, and the minimal number of subgroups necessary for such a decomposition of a given group is determined.
Bhaskara Rao, K. P. S., Reid, J. D.
openaire   +2 more sources

Centralisers of finite subgroups in soluble groups of type FPn

open access: yes, 2009
We show that for soluble groups of type FPn , centralisers of finite subgroups need not be of type ...
Martínez-Pérez, Conchita   +5 more
core   +1 more source

Fully inert subgroups of divisible Abelian groups [PDF]

open access: yes, 2013
A subgroup H of an Abelian group G is said to be fully inert if the quotient (H + phi(H)/H is finite for every endomorphism phi of G. Clearly, this is a common generalization of the notions of fully invariant, finite and finite-index subgroups.
Salce, Luigi   +6 more
core   +1 more source

Pinned-flags of some operations on fuzzy subgroups

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2005
Fuzzy subgroups of finite groups have been treated recently using the concept of pinned-flags. In this paper, we consider the operations of intersection, sum, product, and quotient of fuzzy subgroups of finite abelian groups in general, in terms of ...
B. B. Makamba, V. Murali
doaj   +1 more source

When the intrinsic algebraic entropy is not really intrinsic

open access: yesTopological Algebra and its Applications, 2015
The intrinsic algebraic entropy ent(ɸ) of an endomorphism ɸ of an Abelian group G can be computed using fully inert subgroups of ɸ-invariant sections of G, instead of the whole family of ɸ-inert subgroups.
Goldsmith Brendan, Salce Luigi
doaj   +1 more source

Minimal non-abelian groups with an average condition on subgroups [PDF]

open access: yesJournal of Mahani Mathematical Research
For a finite group $G$, the average order   $o(G)$   is defined to be the average of all order elements in $G$. We say that $G$ satisfies the average condition if $o(H)\leq o(G)$ for all subgroups $H$ of $G$.
Bijan Taeri, Ziba Tooshmalani
doaj   +1 more source

Home - About - Disclaimer - Privacy