Zobrazeno 1 - 10
of 11
pro vyhledávání: '"D. H. McLain"'
Autor:
D. H. McLain
Publikováno v:
Glasgow Mathematical Journal. 18:51-56
Suppose that G is a finitely presented group, and that we are given a set of generators for a subgroup H of finite index in G. In this paper we describe an algorithm by which a set of defining relations may be found for H in these generators.The algo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9e87730e06e24f090638ff7de3cc6618
https://doi.org/10.1017/s0017089500003025
https://doi.org/10.1017/s0017089500003025
Autor:
D. H. McLain
Publikováno v:
The Computer Journal. 19:178-181
A method is described for smooth interpolation between random data points in two or more dimensions. The method gives a smooth surface passing exactly through the given data points, and is suitable for graphical applications. It has practical advanta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41f4b2740738591561ca23cc36c4fd28
https://doi.org/10.1093/comjnl/19.2.178
https://doi.org/10.1093/comjnl/19.2.178
Autor:
D. H. McLain, T. R. Ellis
Publikováno v:
ACM Transactions on Mathematical Software. 3:175-179
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99a2683bbad0d035deafd805f54ca839
https://doi.org/10.1145/355732.355738
https://doi.org/10.1145/355732.355738
Autor:
D. H. McLain
Publikováno v:
The Computer Journal. 17:318-324
This paper describes a computer method for drawing, on an incremental plotter, a set of contours when the height is available only for some arbitrary collection of points. The method is based on a distance-weighted, least-squares approximation techni
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ad7dda24c76a802b9ac82a28d890f84
https://doi.org/10.1093/comjnl/17.4.318
https://doi.org/10.1093/comjnl/17.4.318
Autor:
A. M. Duguid, D. H. McLain
Publikováno v:
Mathematical Proceedings of the Cambridge Philosophical Society. 52:391-398
Let an element of a group be called an FC element if it has only a finite number of conjugates in the group. Baer(1) and Neumann (8) have discussed groups in which every element is FC, and called them FC-groups. Both Abelian and finite groups are tri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c9d4912ab63d202e4949005530c4f7b
https://doi.org/10.1017/s030500410003139x
https://doi.org/10.1017/s030500410003139x
Autor:
P. Hall, D. H. McLain
Publikováno v:
Mathematical Proceedings of the Cambridge Philosophical Society. 52:5-11
1. If P is any property of groups, then we say that a group G is ‘locally P’ if every finitely generated subgroup of G satisfies P. In this paper we shall be chiefly concerned with the case when P is the property of being nilpotent, and will exam
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52885373a71912bbd5f58e5f26a07a9b
https://doi.org/10.1017/s0305004100030905
https://doi.org/10.1017/s0305004100030905
Autor:
D. H. McLain
Publikováno v:
Journal of the London Mathematical Society. :177-184
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d656a29d9469758b58e0fa3404ddc3c2
https://doi.org/10.1112/jlms/s1-34.2.177
https://doi.org/10.1112/jlms/s1-34.2.177
Autor:
D. H. McLain
Publikováno v:
Journal of the London Mathematical Society. :101-107
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa1162e825ccda9e240728952727a086
https://doi.org/10.1112/jlms/s1-34.1.101
https://doi.org/10.1112/jlms/s1-34.1.101
Autor:
D. H. McLain
Publikováno v:
Proceedings of the Glasgow Mathematical Association. 3:38-44
Following, for example, Kurošs [8], we define the (transfinite) upper central series of a group G to be the seriessuch that Zα + 1/Za is the centre of G/Zα, and if β is a limit ordinal, then If α is the least ordinal for which Zα =Zα+1=…, th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f3b6523894f9637119fc607bb58ff80
https://doi.org/10.1017/s2040618500033414
https://doi.org/10.1017/s2040618500033414
Autor:
D. H. McLain
Publikováno v:
Mathematical Proceedings of the Cambridge Philosophical Society. 53:278-285
1. Discussion of results1·1. Introduction: The classical theorem of Lagrange states that the order of a subgroup of a finite group G divides the order, (G), of G. More generally, if H and K are subgroups of G, and H ≥ K, then (G:K) = (G:H)(H:K), w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18fe51a087588e262cdd6190711a58e5
https://doi.org/10.1017/s0305004100032308
https://doi.org/10.1017/s0305004100032308