首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
Perfect isometries and isotypies are constructed for alternating groups between blocks with abelian defect groups and the Brauer correspondents of these blocks. These perfect isometries and isotypies satisfy additional compatibility conditions which imply that an extended Broué conjecture holds for the principal block of an almost simple group with an abelian Sylow -subgroup and a generalized Fitting subgroup isomorphic to an alternating group.

  相似文献   


2.
We describe the reduced periodically complete groups, algebraically compact groups, and torsion-free completely decomposable groups with right-invariant monomorphisms preserving the p-heights of the elements of the group under study.  相似文献   

3.
Using smooth one-fixed-point actions on spheres and a result due to Bob Oliver on the tangent representations at fixed points for smooth group actions on disks, we obtain a similar result for perfect group actions on spheres. For a finite group , we compute a certain subgroup of the representation ring . This allows us to prove that a finite perfect group has a smooth -proper action on a sphere with isolated fixed points at which the tangent representations of are mutually nonisomorphic if and only if contains two or more real conjugacy classes of elements not of prime power order. Moreover, by reducing group theoretical computations to number theory, for an integer and primes , we prove similar results for the group , , or . In particular, has Smith equivalent representations that are not isomorphic if and only if , , .

  相似文献   


4.
The theorems of Jordan, Frobenius, M. Hall, Brauer-Suzuki-Wall, Shunkov, Mazurov, and Belyaev are generalized.  相似文献   

5.
For any group G, let |Cent(G)| denote the number of centralizers of its elements. A group G is called n-centralizer if |Cent(G)| = n. In this paper, we find |Cent(G)| for all minimal simple groups. Using these results we prove that there exist finite simple groups G and H with the property that |Cent(G)| = |Cent(H)| but ${G\not\cong H}$ . This result gives a negative answer to a question raised by A. Ashrafi and B. Taeri. We also characterize all finite semi-simple groups G with |Cent(G)| ≤  73.  相似文献   

6.
7.
The nonsystematic perfect q-ary codes over finite field F q of length n = (q m − 1)/(q − 1) are constructed in the case when m ≥ 4 and q ≥ 2 and also when m = 3 and q is not prime. For q ≠ 3, 5, these codes can be constructed by switching seven disjoint components of the Hamming code H q n ; and, for q = 3, 5, eight disjoint components.  相似文献   

8.
We propose a construction of full-rank q-ary 1-perfect codes. This is a generalization of the construction of full-rank binary 1-perfect codes by Etzion and Vardy (1994). The properties of the i-components of q-ary Hamming codes are investigated, and the construction of full-rank q-ary 1-perfect codes is based on these properties. The switching construction of 1-perfect codes is generalized to the q-ary case. We propose a generalization of the notion of an i-component of a 1-perfect code and introduce the concept of an (i, σ)-component of a q-ary 1-perfect code. We also present a generalization of the Lindström–Schönheim construction of q-ary 1-perfect codes and provide a lower bound for the number of pairwise distinct q-ary 1-perfect codes of length n.  相似文献   

9.
A three-player game is considered in which the first and second players have dynamic superiority over the third player. Two fixed time points are specified. The game ends if either the first player captures the third player at the first time point, or the second player captures the third player at the second time point. We analyze a situation when the initial positions in the game are such that neither the first nor the second player alone can capture the third player at the specified points of time. We propose sufficient conditions on the parameters of the game under which, for given initial states of the players, the first and second players by applying some controls can guarantee that one of them will meet the third player at the prescribed moment. Simulation results for a model example are also presented.  相似文献   

10.
11.
On finite soluble groups   总被引:3,自引:0,他引:3  
  相似文献   

12.
13.
14.
Let Γ be a convex co-compact group of isometries of a CAT(−1) space X and let Γ0 be a normal subgroup of Γ. We show that, provided Γ is a free group, a sufficient condition for Γ and Γ0 to have the same critical exponent is that Γ / Γ0 is amenable.   相似文献   

15.
16.
On automorphism groups of some finite groups   总被引:1,自引:0,他引:1  
We show that if n > 1 is odd and has no divisor p4 for any prime p, then there is no finite group G such that│Aut(G)│ = n.  相似文献   

17.
18.
Let A = (A,⊕,,, 0, 1) be a GMV-algebra and ρ: A × AA the distance function on A defined by ρ(x, y) = (xy)−(xy) for each x, yA.  相似文献   

19.
Let ?? be a subgroup of ${{\rm GL}_d(\mathbb{Z}[1/q_0])}$ generated by a finite symmetric set S. For an integer q, denote by ?? q the projection map ${\mathbb{Z}[1/q_0] \to \mathbb{Z}[1/q_0]/q \mathbb{Z}[1/q_0]}$ . We prove that the Cayley graphs of ?? q (??) with respect to the generating sets ?? q (S) form a family of expanders when q ranges over square-free integers with large prime divisors if and only if the connected component of the Zariski-closure of ?? is perfect, i.e. it has no nontrivial Abelian quotients.  相似文献   

20.
The permutizer of a subgroup H in a group G is defined as the subgroup generated by all cyclic subgroups of G that permute with H. Call H permuteral in G if the permutizer of H in G coincides with G; H is called strongly permuteral in G if the permutizer of H in U coincides with U for every subgroup U of G containing H. We study the finite groups with given systems of permuteral and strongly permuteral subgroups and find some new characterizations of w-supersoluble and supersoluble groups.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号