[High score] [High score addition] for help, graduation thesis on “replacement group”.

Introduction: Mathematics of replacement group operations and proof

Directory
Abstract
abstract
1.1 scientific computing and computer algebraic system. Arrange
The chapter group theory of knowledge background
2.1 replacement group
2.2 replacement group operations and its role in collection
2.3 miniature
Chapter 3 replacement group Computer implementation of computing and proof
3.1 Implementation of operations on the replacement group 3.2 Computer implementation of switching group certification
3.3 Summary
Chapter 4 Calculating Symatic Group Subtopes
4.1 Data indicates indicating Calculation method
4.2 Switching sub -groups in symmetrical groups.
.
Chapter 5 Concluding Symbol
Cup .1 group theory and algorithm
5.2 pair A. Outlook for computer certification for a single group.
5.3 The limitations of the computer algebraic system
thanks
The algorithm of group theory is a very meaningful question. Most of the groups encountered in practical applications are very complicated, and they need to use computers to achieve its operations. This article uses the computer algebra system to implement the operation and proof of the replacement group.
The problems such as the base wood operations on the replacement group, the operation and generation of subunitions, and the role of the cluster pairs, we designed the corresponding algorithm and used these algorithms.
The expiration group A. The elements are classified according to the common classification, and all possible combinations of the order of the co -category except the co -category where the unit element is located. 1. Then remove the {an results in turn. If there is a number of K in it so that K can be removed {an i, then the cluster that is combined with the class that is added to K is possible to be generated by the cluster. Become A. Extraordinary regular sub -group. Starting from this theory, we designed a computer algebra to judge A. Whether it is a single group algorithm, when N u003C10 can quickly draw an conclusion that An (n} 4) is a single group.
Caley theorem revealed the relationship between an abstract group G and a specific group SN. If you can find out all the N -step sub -groups of the same structure in SN, then you can find out all possible N -step groups. This article discusses all subgroups of calculating symmetrical groups and algorithms that co -classified them. As an example, we have completed the common classification of all subgroups of} s (n_7).

Directory
Abnormal
abstract.
1. Introduction
2. Ruan Squai inch orbital
3.2 Self -assembly pairing of 8 in length
3.3 Self -assembly pairing of 14 to 14 Self -assembly of the 24 self -assembly of the 24 self -matched pair orbit with a length of 28
3.7 Self -assembly pair of 42 -length pair orbit
3.8 Self -woven inch orbit with a length of 56 n 3.9 Self -assembly of 84 self -matched orbits
References

Abstract
AES2, order G. Two {9 [g} as two a}
is the stable sub -group of point A. We call G. The orbital of the few effects on the several of the effects of G is about A, and the number of the second orbit is called the rank of G. For any orbital △, set AS E △, then AS_, the sub -orbital △ It is called the sub -orbital paired with △. When the two coincide, it is called the self -matched.
The sub -orbital structure that determines a replacement group is one of the basic questions for replacement group theory. There are important applications in the research. In text! 21], the author determines the sub -track of the original replacement of PSL (3, Sichuan about the great sub -group PSL (2, 7) ), But did not study the situation of the second orbit. In most cases, the application of the group in the combined structure requires the matching of the second orbit. This article will determine the sub -track of all the non -regular pairing of the replacement representation.

What professional? Intersection