An algorithm for the construction of a defining set of relations w.r.t. a given set of generators of a finite group G is presented. Compared with previously known methods it yields fewer relations and is better suited for iterated application to large groups. These improvements are achieved by consi
Elements of finite order in groups with a single defining relation
β Scribed by A. Karrass; W. Magnus; D. Solitar
- Publisher
- John Wiley and Sons
- Year
- 1960
- Tongue
- English
- Weight
- 537 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0010-3640
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract All finite solvable groups that have symmetric sequencings are characterized. Let __G__ be a finite solvable group. It is shown that __G__ has a symmetric sequencing if and only if __G__ has a unique element of order two and is not the quaternion group. All finite groups with a unique e
Accorsi has recently proposed a general method for modelling microstructural material discontinuities in a finite element analysis. In this work, it is shown that his method can be significantly simplified. In particular, the transformation strain (eigenstrain) plays no role in his application. Nume
## Abstract A realβcoded clonal selection algorithm (RCSA), which is a global search method based on the artificial immune systems paradigm, is applied for optimizing microwave devices. We couple RCSA with varying highβorder finite elements (FEs) to control the balance between the global and local
A finite element model based on third order laminate theory is developed for the active position control and vibration control of composite beams with distributed peizoelectric sensors and actuators. The direct peizoelectric equation is used to calculate the total charge created by the strains on th