In this paper, we showed how groups are embedded into wreath products, we gave a simpler proof of the theorem by Audu (1991) (see <a href="#ref1">[1]</a>), also proved that a group can be embedde...In this paper, we showed how groups are embedded into wreath products, we gave a simpler proof of the theorem by Audu (1991) (see <a href="#ref1">[1]</a>), also proved that a group can be embedded into the wreath product of a factor group by a normal subgroup and also proved that a factor group can be embedded inside a wreath product and the wreath product of a factor group by a factor group can be embedded into a group. We further showed that when the abstract group in the Universal Embedding Theorem is a <em>p</em>-group, cyclic and simple, the embedding becomes an isomorphism. Examples were given to justify the results.展开更多
A.M.W. Glass and S.H.McCleary have given the 2 transitive representation of the countable free l group F η(1<η≤ω 0 ).In this paper we shall give the highly ordered transitive representation of count...A.M.W. Glass and S.H.McCleary have given the 2 transitive representation of the countable free l group F η(1<η≤ω 0 ).In this paper we shall give the highly ordered transitive representation of countable free groups on the rational line Q, which generalizes their results. As applications,we obtain the highly ordered transitive representation for the direct product of countable free groups,and the inverse limit of countable free groups must be an action on the set Q.展开更多
External direct product of some low layer groups such as braid groups and general Artin groups, with a kind of special group action on it, provides a secure cryptographic computation platform, which can keep secure in...External direct product of some low layer groups such as braid groups and general Artin groups, with a kind of special group action on it, provides a secure cryptographic computation platform, which can keep secure in the quantum computing epoch. Three hard problems on this new platform, Subgroup Root Problem, Multi-variant Subgroup Root Problem and Subgroup Action Problem are presented and well analyzed, which all have no relations with conjugacy. New secure public key encryption system and key agreement protocol are designed based on these hard problems. The new cryptosystems can be implemented in a general group environment other than in braid or Artin groups.展开更多
文摘In this paper, we showed how groups are embedded into wreath products, we gave a simpler proof of the theorem by Audu (1991) (see <a href="#ref1">[1]</a>), also proved that a group can be embedded into the wreath product of a factor group by a normal subgroup and also proved that a factor group can be embedded inside a wreath product and the wreath product of a factor group by a factor group can be embedded into a group. We further showed that when the abstract group in the Universal Embedding Theorem is a <em>p</em>-group, cyclic and simple, the embedding becomes an isomorphism. Examples were given to justify the results.
文摘A.M.W. Glass and S.H.McCleary have given the 2 transitive representation of the countable free l group F η(1<η≤ω 0 ).In this paper we shall give the highly ordered transitive representation of countable free groups on the rational line Q, which generalizes their results. As applications,we obtain the highly ordered transitive representation for the direct product of countable free groups,and the inverse limit of countable free groups must be an action on the set Q.
基金Supported by the National Natural Science Funda-tion of China (60403027)
文摘External direct product of some low layer groups such as braid groups and general Artin groups, with a kind of special group action on it, provides a secure cryptographic computation platform, which can keep secure in the quantum computing epoch. Three hard problems on this new platform, Subgroup Root Problem, Multi-variant Subgroup Root Problem and Subgroup Action Problem are presented and well analyzed, which all have no relations with conjugacy. New secure public key encryption system and key agreement protocol are designed based on these hard problems. The new cryptosystems can be implemented in a general group environment other than in braid or Artin groups.
