Results 31 to 40 of about 1,000,341 (271)

On finite C-tidy groups [PDF]

open access: yesInternational Journal of Group Theory, 2013
A group G is said to be a C-tidy group if for every element x € G K(G), the set Cyc(x)={y € G | is cyclic} is a cyclic subgroup of G, where K(G) is the intersection of all the Cyc(x) in G.
Sekhar Jyoti Baishya
doaj  

Noncommutative Geometry of Finite Groups

open access: yes, 1995
A finite set can be supplied with a group structure which can then be used to select (classes of) differential calculi on it via the notions of left-, right- and bicovariance. A corresponding framework has been developed by Woronowicz, more generally for
Andrzej Sitarz   +27 more
core   +2 more sources

Finite group with some c#-normal and S-quasinormally embedded subgroups

open access: yesOpen Mathematics
Let pp be a prime that divides the order of a finite group GG, and let PP be a Sylow pp-subgroup of GG. Assume that dd is the smallest number of generators of PP and define ℳd(P)={P1,P2,…,Pd}{{\mathcal{ {\mathcal M} }}}_{d}\left(P)=\left\{{P}_{1},{P}_{2},
Li Ning, Jiang Jing, Liu Jianjun
doaj   +1 more source

Maximal subgroups of the group PSL(12, 2) [PDF]

open access: yesSurveys in Mathematics and its Applications, 2011
In this paper, We will find the maximal subgroups of the group PSL(12, 2) by Aschbacher's Theorem [M. Aschbacher, Invent. Math. 1984]
Rauhi Ibrahim Elkhatib
doaj  

Subgroup Graphs of Finite Groups

open access: yesInternational Journal of Applied Sciences and Smart Technologies, 2021
Let G be a fnite group with the set of subgroups of G denoted by S(G), then the subgroup graphs of G denoted by T(G) is a graph which set of vertices is S(G) such that two vertices H, K in S(G) (H not equal to K) are adjacent if either H is a subgroup of
Ojonugwa Ejima   +2 more
doaj   +1 more source

Bicrossed products for finite groups

open access: yes, 2009
We investigate one question regarding bicrossed products of finite groups which we believe has the potential of being approachable for other classes of algebraic objects (algebras, Hopf algebras). The problem is to classify the groups that can be written
A. Chirvăsitu   +15 more
core   +2 more sources

Finitely generated -groups [PDF]

open access: yesJournal of the Australian Mathematical Society, 1967
This paper is taken from the author's doctoral dissertation at New York University; the work was supported by the National Science Foundation, Grant G19674. The author would like to thank Professor Gilbert Baumslag for suggesting the questions treated in this paper, and for his very helpful guidance.
openaire   +1 more source

Functional Connectivity Linked to Cognitive Recovery After Minor Stroke

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Patients with minor stroke exhibit slowed processing speed and generalized alterations in functional connectivity involving frontoparietal cortex (FPC). The pattern of connectivity evolves over time. In this study, we examine the relationship of functional connectivity patterns to cognitive performance, to determine ...
Vrishab Commuri   +7 more
wiley   +1 more source

Signless Laplacian spectrum of power graphs of finite cyclic groups

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
In this paper, we have studied the Signless Laplacian spectrum of the power graph of finite cyclic groups. We have shown that is an eigen value of Signless Laplacian of the power graph of with multiplicity at least In particular, using the theory of ...
Subarsha Banerjee, Avishek Adhikari
doaj   +1 more source

Strongly bounded groups and infinite powers of finite groups

open access: yes, 2006
We define a group as strongly bounded if every isometric action on a metric space has bounded orbits. This latter property is equivalent to the so-called uncountable strong cofinality, recently introduced by G. Bergman.
Bridson M. R.   +6 more
core   +2 more sources

Home - About - Disclaimer - Privacy