一类3元生成的有限可解群

设Ｇ是个有限可解解，若对Ｇ的每个商群Ｈ，Ｈ的正规Ａｂｅｌ子群都是可以由２元生成的，则称Ｇ为ＡＤ２－群，在本文里，我们证明了：如果Ｇ是个ＡＤ２－群，那么Ｇ是３元生定的，且Ｇ＾（６）＝１。另外，我们举了２个例子，说明这些界都是最好的。     

p6阶群的自同构群的阶

In this paper, we determine the order of automorphism group of p-groups in the third family (Φ3 ) and the fourth family (Φ4 ) in [ 1 ], whose order is p^6 ( p ≥ 3). Here p denotes an odd prime.     

不充当自同构群的有限群

设ｐ为奇素数，本文将用一些新的技巧来证明，当Ｐ是阶小于Ｐ＾１１的交换Ｐ－群时，自同构群方程Ａｕｔ（Ｘ）＝Ｐ无解。这个结果使ＭａｃｈＨａｌｅ在１９８３年的工作得到了突破，并且我们所给的方法具有广泛性。     

自同构群是循环群被交换群扩张的有限群

设Ｃ是有限群，ＡｕｔＧ＝ＡＢ，，Ａ是交换群且每Ｓｙｌｏｗ子群的秩≤２，Ｂ是循环群，本文得出了Ｇ的结构，特别地，证明了ＡｕｔＧ是秩≤２的交换群时，Ｇ循环。     

具有4pq阶自同构群的有限群

本文讨论了自同构群阶为4pq(p,q为不同奇素数)的有限群,得出了它们的构造.     

子群的核平凡或正规闭包极大的有限p群

称有限p群G为ACT群,如果对每个交换子群H,其正规核HG=1或HG=H.又称p群G是CC群,如果对每个非正规交换子群H,有HG=1或HG在G中的指数为p.本文分类了ACT群和CC群.     

自同构群

设Ｇ是有限群，ＡｕｔＧ＝ＡＢ，Ｂ△ＡｕｔＧ，（｜Ａ｜，｜Ｂ｜）＝１，Ａ是交换群且每Ｓｙｏｗ子群的秩≤２，Ｂ是循环群。本文得出了Ｇ的结构，特别地，证明了ＡｕｔＧ是秩≤的交换群时，Ｇ循环。     

Soluble Groups with Few Non-Baer Subgroups

We characterize non-finitely generated soluble groups with the maximal condition on non-Baer subgroups and prove that a non-Baer soluble group is a ^ˇCernikov group or it has an infinite properly descending series of non-Baer subgroups.     

Curran猜想的解答

本文确定了能作为有限群自同构群的Ｐ－群的最佳下最，彻底解决了Ｃｕｒｒａｎ在１９８９年提出的关于此最佳下界的三个猜想。     

Subgroup coverings of some sporadic groups

A set of proper subgroups is a covering for a group if their union is the whole group. Determining the size of a smallest covering is an open problem for many simple groups. For some of the sporadic groups, we find subgroup coverings of minimal cardinality. For others we specify the isomorphism types of subgroups in a smallest covering and use graphs to calculate bounds for its size.     

Gröbner–Shirshov Bases for Schreier Extensions of Groups

In this article, by using the Gröbner–Shirshov bases, we give characterizations of the Schreier extensions of groups when the group is presented by generators and relations. An algorithm to find the conditions of a group to be a Schreier extension is obtained. By introducing a special total order, we obtain the structure of the Schreier extension by an HNN group.     

有限可解群的Fuzzy子群的阶数及其等价类数

定义Fuzzy子群的一种等价关系,即:如果两个Fuzzy子群的水平集的阶构成的集合相等, 就称这两个Fuzzy子群等价,并且通过研究群的子群列以及群阶的因数列和商数列找出了有限可解群的极大Fuzzy子群和Fuzzy子群的阶和等价类数的求解公式,并给出了二者之间的关系式.     

Group Gradings on Polynomial Algebras

Let k be a field. We consider gradings on a polynomial algebra k[X₁,…, X_n] by an arbitrary abelian group G, such that the indeterminates are homogeneous elements of nontrivial degree. We classify the isomorphism types of such gradings, and we count them in the case where G is finite. We present some examples of good gradings and find a minimal set of generators of the subalgebra of elements of trivial degree.     

Linear recurring sequence subgroups in finite fields

Given a finite field and a linear recurrence relation over it is possible to find, in a fairly “obvious” way, a finite extension of and a subgroup M of the multiplicative group of such that the elements of M may be written, without repetition, so as to form a cyclically closed sequence which obeys the recurrence. Here we investigate this phenomenon for second-order recurrences; the situation in which has prime order and the characteristic polynomial of the relation is irreducible over is described.     

Intuitionistic and interval-valued intutionistic fuzzy preference relations and their measures of similarity for the evaluation of agreement within a group

Szmidt and Kacprzyk (Lecture Notes in Artificial Intelligence 3070:388–393, 2004a) introduced a similarity measure, which takes into account not only a pure distance between intuitionistic fuzzy sets but also examines if the compared values are more similar or more dissimilar to each other. By analyzing this similarity measure, we find it somewhat inconvenient in some cases, and thus we develop a new similarity measure between intuitionistic fuzzy sets. Then we apply the developed similarity measure for consensus analysis in group decision making based on intuitionistic fuzzy preference relations, and finally further extend it to the interval-valued intuitionistic fuzzy set theory.     

Teaching and learning mathematics in the collective

In this paper we analyse and explore teaching and learning in the context of a high school mathematics classroom that was deliberately structured as highly interactive and inquiry-oriented. We frame our discussion within enactivism—a theory of cognition that has helped us to understand classroom processes, particularly at the level of the group. We attempt to show how this classroom of mathematics learners operated as a collective and focus in particular on the role of the teacher in establishing, sustaining, and becoming part of such a collective. Our analysis reveals teaching practices that value, capitalize upon, and promote group cognition, our discussion positions such work as teaching a way of being with mathematics, and we close by offering implications for teaching, educational policy, and further research.     

Learning and forgetting effects on a group scheduling problem

This paper proposes to investigate learning and forgetting effects on the problem of scheduling families of jobs on a single machine to minimize total completion time of jobs. A setup time is incurred whenever the single machine transfers job processing from a family to another family. To analyze the impact of learning and forgetting on this group scheduling problem, we structure three basic models and make some comparisons through computational experiments. The three models, including no forgetting, total forgetting and partial forgetting, assume that the processing time of a job is dependent on its position in a schedule. Some scheduling rules and a lower bound are derived in order to constitute our branch-and-bound algorithm for searching an optimal sequence. In addition, an efficient and simply-structured heuristic is also built to find a near-optimal schedule.     

Decomposition Numbers and Cartan Invariants of S p(4,q), q = 2 n,for p = 2*

Let G be the 4-dimensional sympletic group on a finite field of q elements, q a power of 2. We find all the decomposition numbers of G in characteristic 2, corresponding to the unipotent characters of G. We also find some of the Cartan invariants of G for p = 2.     

Unfair allocation of gains under the Equal Price allocation method in purchasing groups

Certain purchasing groups do not flourish. A supposed reason for this is a creeping dissatisfaction among various members of a group with the allocation of the cooperative gains. In this paper, we analyze unfairness resulting from using the commonly used Equal Price (EP) method for allocating gains under the assumption of continuous quantity discounts. We demonstrate that this unfairness is caused by neglecting a particular component of the added value of individual group members. Next, we develop two fairness ratios and tie these to fairness properties from cooperative game theory. The ratios show among other things that being too-big a player in a purchasing group can lead to decreasing gains. They can be used to assess if EP is an unfair method in specific situations. Finally, we discuss measures a purchasing group could consider in order to attenuate perceived unfairness. Thereby, the group may improve its stability and prosperity.