Results 231 to 240 of about 7,195,217 (249)
Some of the next articles are maybe not open access.

The Automorphism Groups of the Braid Groups

American Journal of Mathematics, 1981
In the first of two papers published in the Annals in 1947 [3] Emil Artin mentioned the problem of determining all automorphisms of the braid groups (of the Euclidean plane), and in the second [4] took a first step towards a solution. The main result of this paper is a complete determination of these automorphism groups: the outer automorphism group is
Dyer, Joan L., Grossman, Edna K.
openaire   +1 more source

Group Trust and Group Reputation

2009 Fifth International Conference on Natural Computation, 2009
Trust and reputation play a vital role in the interactions of agents. Previous researches mostly concern individual agents, while group trust and group reputation are largely ignored. To this end, we present a Computational Model of Group trust and group reputation (CMGTGR) which as well as affects interactions of individual agents.
Xiangrong Tong, Wei Zhang
openaire   +1 more source

To Group or Not to Group

The Clearing House: A Journal of Educational Strategies, Issues and Ideas, 1960
Fundamentally, it is impossible to escape some kind of grouping of students. At one end of the scale is random or what we call heterogeneous grouping. At the other end, there is ability or some other type of homogeneous grouping in all major subject areas. In between, it is a question of how much grouping for whom and in what subjects.
openaire   +1 more source

Groups, Groups of Groups, and Complex Stability

SSRN Electronic Journal, 2010
Many politically and economically important groups are themselves comprised of groups. Examples of such multilevel group structures include coalition governments, labor confederations and multinational agreements. This paper develops a model of multilevel group structures.
openaire   +1 more source

Stable Groups and Algebraic Groups

Journal of the London Mathematical Society, 2000
Let \(G\) be a stable, saturated group, \(p\) be the strong type of an element of \(G\), and \(\langle p\rangle\) be the smallest type-definable (over \(\text{acl}(\emptyset)\)) subgroup of \(G\) containing \(p^G\). By \textit{L. Newelski}'s theorem [Notre Dame J. Formal Logic 32, No.
openaire   +2 more sources

Groups

Journal of Psychiatric Practice, 2023
openaire   +2 more sources

Group IV: The silicon group

1971
E. W. Abel   +2 more
openaire   +1 more source

Group Rights and Group Oppression *

Journal of Political Philosophy, 1999
openaire   +2 more sources

Home - About - Disclaimer - Privacy