Home Another measuring argument for finite permutation groups
Article
Licensed
Unlicensed Requires Authentication

Another measuring argument for finite permutation groups

  • Avi Goren
Published/Copyright: January 4, 2008
Journal of Group Theory
From the journal Volume 10 Issue 6

Abstract

Let G denote a finite group of permutations of a finite set Ω. Given an orbit function ω : Ω → ℝ and a class function ƒ : G → ℝ and their extensions to subsets of Ω and G, consider the quantity mω,ƒ, which is the maximal value of ω(Γ)ƒ(CG(Γ)) over all nontrivial subsets Γ of Ω. Denote by ℳ the set of non-empty subsets Γ of Ω which satisfy m(Γ)ƒ(CG(Γ) = mω,ƒ. Our main result, Theorem 1, states that if ℳ contains a unique maximal or minimal element Δ with respect to inclusion, then Δg = Δ for each gG and CG(Δ) is a normal subgroup of G. This result may have potential future applications. As an example of an application of Theorem 1 we prove that if either G is a simple group or it is transitive on Ω, T is a normal subset of G not containing 1, Θ is a G-invariant subset of Ω and Γ ⊆ Ω, then (see Theorem 6).


(Communicated by R. M. Guralnick)


Received: 2006-08-02
Revised: 2007-01-29
Published Online: 2008-01-04
Published in Print: 2007-11-20

© Walter de Gruyter

Downloaded on 18.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/JGT.2007.061/html
Scroll to top button