English

Intersection density of imprimitive groups of degree $pq$

Combinatorics 2023-12-12 v2 Group Theory

Abstract

A subset F\mathcal{F} of a finite transitive group GSym(Ω)G\leq \operatorname{Sym}(\Omega) is \emph{intersecting} if any two elements of F\mathcal{F} agree on an element of Ω\Omega. The \emph{intersection density} of GG is the number ρ(G)=max{F/GωFG\mboxisintersecting},\rho(G) = \max\left\{ \mathcal{|F|}/|G_\omega| \mid \mathcal{F}\subset G \mbox{ is intersecting} \right\}, where ωΩ\omega \in\Omega and GωG_\omega is the stabilizer of ω\omega in GG. It is known that if GSym(Ω)G\leq \operatorname{Sym}(\Omega) is an imprimitive group of degree a product of two odd primes p>qp>q admitting a block of size pp or two complete block systems, whose blocks are of size qq, then ρ(G)=1\rho(G) = 1. In this paper, we analyse the intersection density of imprimitive groups of degree pqpq with a unique block system with blocks of size qq based on the kernel of the induced action on blocks. For those whose kernels are non-trivial, it is proved that the intersection density is larger than 11 whenever there exists a cyclic code CC with parameters [p,k]q[p,k]_q such that any codeword of CC has weight at most p1p-1, and under some additional conditions on the cyclic code, it is a proper rational number. For those that are quasiprimitive, we reduce the cases to almost simple groups containing Alt(5)\operatorname{Alt}(5) or a projective special linear group. We give some examples where the latter has intersection density equal to 11, under some restrictions on pp and qq.

Keywords

Cite

@article{arxiv.2207.07762,
  title  = {Intersection density of imprimitive groups of degree $pq$},
  author = {Angelot Behajaina and Roghayeh Maleki and Andriaherimanana Sarobidy Razafimahatratra},
  journal= {arXiv preprint arXiv:2207.07762},
  year   = {2023}
}

Comments

Accepted version