Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe minimal base size for a p-solvable linear group
276
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Let $V$ be a finite vector space over a finite field of order $q$ and of characteristic $p$. Let $Gleq GL(V)$ be a $p$-solvable completely reducible linear group. Then there exists a base for $G$ on $V$ of size at most $2$ unless $q leq 4$ in which case there exists a base of size at most $3$. The first statement extends a recent result of Halasi and Podoski and the second statement generalizes a theorem of Seress. An extension of a theorem of Palfy and Wolf is also given.
rate research
Read More
Let G be a linear group acting on the finite vector space V and assume that (|G|,|V|)=1. In this paper we prove that G has a base size at most two and this estimate is sharp. This generalizes and strengthens several former results concerning base sizes of coprime linear groups. As a direct consequence, we answer a question of I. M. Isaacs in the affirmative. Via large orbits this is related to the k(GV) theorem.
In this paper we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. We give bounds on the order, base size, minimal degree, fixity, and chief length of an arbitrary finite semiprimitive group in terms of its degree. To establish these bounds, we classify finite semiprimitive groups that induce the alternating or symmetric group on the set of orbits of an intransitive normal subgroup.
Let $m$ be a positive integer and let $Omega$ be a finite set. The $m$-closure of $Gleqoperatorname{Sym}(Omega)$ is the largest permutation group on $Omega$ having the same orbits as $G$ in its induced action on the Cartesian product $Omega^m$. The $1$-closure and $2$-closure of a solvable permutation group need not be solvable. We prove that the $m$-closure of a solvable permutation group is always solvable for $mgeq3$.
We obtain non-vanishing of group $L^p$-cohomology of Lie groups for $p$ large and when the degree is equal to the rank of the group. This applies both to semisimple and to some suitable solvable groups. In particular, it confirms that Gromovs question on vanishing below the rank is formulated optimally. To achieve this, some complementary vanishings are combined with the use of spectral sequences. To deduce the semisimple case from the solvable one, we also need comparison results between various theories for $L^p$-cohomology, allowing the use of quasi-isometry invariance.
Building on earlier papers of several authors, we establish that there exists a universal constant $c > 0$ such that the minimal base size $b(G)$ of a primitive permutation group $G$ of degree $n$ satisfies $log |G| / log n leq b(G) < 45 (log |G| / log n) + c$. This finishes the proof of Pybers base size conjecture. An ingredient of the proof is that for the distinguishing number $d(G)$ (in the sense of Albertson and Collins) of a transitive permutation group $G$ of degree $n > 1$ we have the estimates $sqrt[n]{|G|} < d(G) leq 48 sqrt[n]{|G|}$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
