Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Russell D. Blyth"'
A group $G$ is integrable if it is isomorphic to the derived subgroup of a group $H$; that is, if $H'\simeq G$, and in this case $H$ is an integral of $G$. If $G$ is a subgroup of $U$, we say that $G$ is integrable within $U$ if $G=H'$ for some $H\le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cd011aec69c5c4aac6b46a5a71322832
Autor:
Mark Pedigo, Russell D. Blyth
Publikováno v:
Communications in Algebra. 47:4462-4475
In their article, “On the derived subgroup of the free nilpotent groups of finite rank” R. D. Blyth, P. Moravec, and R. F. Morse describe the structure of the derived subgroup of a free nil...
Autor:
Russell D. Blyth, Francesco Fumagalli
Given a finite nonabelian semisimple group G, we describe those groups that have the same holomorph as G, that is, those regular subgroups N ≃ G {N\simeq G} of S ( G ) {S(G)} , the group of permutations on the set G, such that N S ( G )
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f44dff93f49e9c89112d035a12fc74df
http://hdl.handle.net/2158/1221749
http://hdl.handle.net/2158/1221749
Autor:
Russell D. Blyth
Publikováno v:
PRIMUS. 25:265-278
The author has taught an inquiry-based liberal arts mathematics class using the text “The Heart of Mathematics: An Invitation to Effective Thinking” by Edward B. Burger and Michael Starbird a total of 20 times since Spring 2001. The students in t
Autor:
Russell D. Blyth, Julianne G. Rainbolt
Publikováno v:
PRIMUS. 20:217-227
We describe a method by which students in an abstract algebra course can discover classical theorems before they are stated and proved, with the help of leading questions and the software Groups, Algorithms and Programming (GAP) [1].
Publikováno v:
Journal of Algebra. 321:2139-2148
In this paper we develop a theory for computing the nonabelian tensor square and related computations for finitely presented groups and specialize it to polycyclic groups. This theory provides a framework for making nonabelian tensor square computati
Publikováno v:
Computational Group Theory and the Theory of Groups. :27-43
Publikováno v:
Proceedings of the Edinburgh Mathematical Society. 47:305-323
In this paper we compute the non-abelian tensor square for the free 2-Engel group of rank $n>3$. The non-abelian tensor square for this group is a direct product of a free abelian group and a nilpotent group of class 2 whose derived subgroup has expo
A covering of a group is a finite set of proper subgroups whose union is the whole group. A covering is minimal if there is no covering of smaller cardinality, and it is nilpotent if all its members are nilpotent subgroups. We complete a proof that e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::432bef9e85e7e2ce9f657b957cde1af7
Autor:
Russell D. Blyth, Derek J. S. Robinson
Publikováno v:
Communications in Algebra. 23:2171-2180
Let n be an integer greater than 1, and let G be a group. A subset {x1, X2, ..., xn} of n elements of G is said to be rewritable if there are distinct permutations π and σ of {1,2, …, n} such that The group G is said to have the rewriting propert