Definition 1.1. A finitely generated group A is said to admit C(p s ) if the following conditions hold for any positive integer q such that 551
A Note on Frobenius Groups
β Scribed by Paul Flavell
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 87 KB
- Volume
- 228
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
β¦ Synopsis
Two celebrated applications of the character theory of finite groups are Burnside's p β£ q β€ -Theorem and the theorem of Frobenius on the groups that bear his name. The elegant proofs of these theorems were obtained at the beginning of this century. It was then a challenge to find character-free proofs of these results. This was achieved for the p β£ q β€ -Theorem by w x w x w x Bender 1 , Goldschmidt 3 , and Matsuyama 8 in the early 1970s. Their proofs used ideas developed by Feit and Thompson in their proof of the Odd Order Theorem. There is no known character-free proof of Frobenius' Theorem.
w x Recently, Corradi and Horvath 2 have obtained some partial results in Β΄this direction. The purpose of this note is to prove some stronger results. We hope that this will stimulate more interest in this problem.
Throughout the remainder of this note, we let G be a finite Frobenius group. That is, G contains a subgroup H such that 1 / H / G and H l H g s 1 for all g g G y H.
A subgroup with these properties is called a Frobenius complement of G.
The Frobenius kernel of G, with respect to H, is defined by
In the language of permutation groups, this corresponds to having a transitive permutation group in which any two-point stabilizer is trivial.
π SIMILAR VOLUMES
For the quantum function algebras O O M and O O GL , at lth roots of unity q n q n when l is odd, the image under the q-analog of the Frobenius morphism charac-Ε½ . terizes each prime and primitive ideal uniquely up to automorphisms obtained from row and column multiplication of the standard generat
## Abstract We study a concept of group coloring introduced by Jaeger et al. We show that the group chromatic number of a graph with minimum degree Ξ΄ is greater than Ξ΄/(2, ln Ξ΄) and we answer several open questions on the group chromatic number of planar graphs: a construction of a bipartite planar
## Abstract A perfect edge colouring of a graph is defined by the property that all colour matchings are perfect matchings. Every edgeβcoloured graph determines a group of graph automorphisms which preserve the colours of the edges. If the graph is connected, then this group of colour preserving au