»ã±¨Ö÷Ì⣺ÓÐÏÞȺ¼òÖ±¶¨¼¯

»ã±¨ÈË£ºÍõµÇÒø ½ÌÊÚ £¨Öйú¿óÒµ´óѧ£©

»ã±¨¹¦·ò£º2018Äê 5ÔÂ26ÈÕ£¨ÖÜÁù£©9:30

»ã±¨µØÖ·£ºÐ£±¾²¿G507

Ô¼ÇëÈË£º¹ùÐãÔÆ

Ö÷°ì²¿ÃÅ£ºÀíѧԺÊýѧϵ

»ã±¨ÌáÒª£ºLet G be a group> a subset D of G is a determing set of G if every automorphism of G is uniquely determined by its action on D. The determing number of G, denoted by $\alpha(G)$, is the cardinality of a smallest set. A generating set of G is a subset such that every element of G can be expressed as the combination, under the group operation, of finitely many elements of the subset aned their inverses. The cardination of a smallest generating set of G, denote by $\gammea(G)$, is called the generating number of G. a group G is called a DEG_group if $\alpha(G)= \gammea(G)$.

We are going to discuss the determing number of and the generating number of a finite group G, and we also investigate the structure of DEG_groups.

Ó­½ÓÀÏʦ¡¢Ñ§Éú²ÎÓë £¡