Results 161 to 170 of about 9,591,284 (211)

Nilpotent Schemes and Group-Like Schemes [PDF]

open access: yesJournal of Combinatorial Theory - Series A, 2008
We give a definition of nilpotent association schemes as a generalization of nilpotent groups and investigate their basic properties. Moreover, for a group-like scheme, we characterize the nilpotency by its character products.
Akihide Hanaki
exaly   +2 more sources
Some of the next articles are maybe not open access.

Related searches:

NILPOTENCY IN UNCOUNTABLE GROUPS

Journal of the Australian Mathematical Society, 2016
The main purpose of this paper is to investigate the behaviour of uncountable groups of cardinality $\aleph$ in which all proper subgroups of cardinality $\aleph$ are nilpotent. It is proved that such a group $G$ is nilpotent, provided that $G$ has no infinite simple homomorphic images and either $\aleph$ has cofinality strictly larger than $\aleph _{0}
De Giovanni, Francesco, Trombetti, Marco
openaire   +2 more sources

Automorphism Groups of Nilpotent Groups

Bulletin of the London Mathematical Society, 1989
Let \({\mathfrak X}\) denote the class of all finitely generated torsion-free nilpotent groups G such that the derived factor group G/G' is torsion- free. For G in \({\mathfrak X}\), let Aut *(G) denote the group of automorphisms of G/G' induced by the automorphism group of G. If G/G' has rank n and we choose a \({\mathbb{Z}}\)-basis for G/G' then Aut *
Bryant, R. M., Papistas, A.
openaire   +3 more sources

Nilpotent fuzzy groups

Fuzzy Sets and Systems, 1999
The paper examines families of fuzzy groups [cf. \textit{M. Asaad, S. Abou-Zaid}, Fuzzy Sets Syst. 60, No. 3, 321-323 (1993; Zbl 0814.20061); \textit{J.-G. Kim}, Inf. Sci. 83, No. 3-4, 161-174 (1995; Zbl 0870.20057); \textit{M.~A.~A. Mishref}, J. Fuzzy Math. 6, No. 4, 811-819 (1998; Zbl 0922.20067)].
K. C. Gupta, B. K. Sarma
openaire   +2 more sources

On Constructive Nilpotent Groups

2016
The purpose of this paper to review the results on the constructive nilpotent groups, not claiming to be complete. We consider both the fundamental questions, which are general in the computable algebra, such as the problems of existence, uniqueness, and extension of constructivizations (computable copies), and the questions that arise from the study ...
Nazif G. Khisamiev, Ivan V. Latkin
openaire   +2 more sources

Home - About - Disclaimer - Privacy