Results 241 to 250 of about 9,102,050 (290)
Some of the next articles are maybe not open access.
Journal of Group Theory, 2006
\(n\)-Bell groups satisfy the law \([x^n,y]=[x,y^n]\) while \(n\)-Kappe groups satisfy \([[x^n,y],y]=1\). The set of right two-Engel elements of \(G\) is denoted by \(R(G)\). Brandl and Kappe have shown \(G^{n(n-1)}\subseteq R(G)\) for \(n\)-Bell groups \(G\).
DELIZIA, Costantino +2 more
openaire +3 more sources
\(n\)-Bell groups satisfy the law \([x^n,y]=[x,y^n]\) while \(n\)-Kappe groups satisfy \([[x^n,y],y]=1\). The set of right two-Engel elements of \(G\) is denoted by \(R(G)\). Brandl and Kappe have shown \(G^{n(n-1)}\subseteq R(G)\) for \(n\)-Bell groups \(G\).
DELIZIA, Costantino +2 more
openaire +3 more sources
Group Characters and the Structure of Groups
Proceedings of the London Mathematical Society, 1935Ist \(H\) eine Gruppe, deren Charaktere bekannt sind, und \(G\) eine Untergruppe, so erzeugt die Eins-Darstellung von \(G\) einen zusammengesetzten Charakter von \(H\). In dieser Weise läßt sich jede Untergruppe \(G\) durch einen zusammengesetzten Cha-rakter von H bestimmen. Es werden nun, 1.
openaire +2 more sources
Algebra and Logic, 1985
On the basis of a description of the maximal subgroups of finite Ree groups \({}^ 2G_ 2(3^ n)\) the authors prove that for every infinite family K of finite Ree groups the free group with two generators is residually a K-group.
Levchuk, V. M., Nuzhin, Ya. N.
openaire +2 more sources
On the basis of a description of the maximal subgroups of finite Ree groups \({}^ 2G_ 2(3^ n)\) the authors prove that for every infinite family K of finite Ree groups the free group with two generators is residually a K-group.
Levchuk, V. M., Nuzhin, Ya. N.
openaire +2 more sources
Group varieties and group structures
Izvestiya: Mathematics, 2022We explore to what extent the group variety of a connected algebraic group or the group manifold of a real Lie group determines its group structure.
openaire +1 more source
British Journal of Social and Clinical Psychology, 1967
An analysis has been made of the formal sequences of conversation in a small closed therapeutic group over eleven sessions. Without any concern with the content of the conversation it has been possible to demonstrate significant dyadic, triadic and other multiple person situations, the effect of the therapist's remarks and of silences.
openaire +2 more sources
An analysis has been made of the formal sequences of conversation in a small closed therapeutic group over eleven sessions. Without any concern with the content of the conversation it has been possible to demonstrate significant dyadic, triadic and other multiple person situations, the effect of the therapist's remarks and of silences.
openaire +2 more sources
On the Structure of Frobenius Groups
Canadian Journal of Mathematics, 1957Let G be a group which has a faithful representation as a transitive permutation group on m letters in which no permutation other than the identity leaves two letters unaltered, and there is at least one permutation leaving exactly one letter fixed. It is easily seen that if
openaire +1 more source
On the Structure of Half-Groups
Canadian Journal of Mathematics, 1959Furstenberg (1) and the author (4), among others, have exhibited postulate systems for groups in terms of the operation x — y = x + ( — y).Furstenberg also investigated a system obtained by removing one of his postulates which defines what he called a half-group. A structure theorem for half-groups was given in (1).
openaire +2 more sources
On the structure of CDN[]-groups
Ukrainian Mathematical Journal, 1998The paper deals with a special class of groups which are called CDN[\ ]-groups. The main purpose is to describe the nilpotent non-Dedekind groups of that class. A complete list of such groups and their structure is presented.
openaire +1 more source
On the Structure of Orthogonal Groups
American Journal of Mathematics, 1958This theorem was proved by D. E. Dickson [3] in the case of finite ground field, then by J. Dieudonne [4] in the general case. In this paper we will give another proof of this theorem based on a principle given by K. Iwasawa in his paper [6]. The author wishes to express his hearty thanks to Professor Iwasawa who read the original manuscript and gave ...
openaire +2 more sources
Automatic Structures and Groups
2011Automata theory has unified many areas of computer science and mathematics. These include group theory (Thurston automatic groups [11], branch and self similar groups [1] [24]), computable model theory (the theory of automatic structures [5] [17] [16]), finite model theory, algorithms and decidability, logic, model checking and verification.
openaire +1 more source

