The depth of subgroups of \(\text{PSL}(2,q)\). II. (Q375189): Difference between revisions

Let \(H\) be a subgroup of a finite group \(G\). Moreover, let \(\Theta_0:=H\), \(\Theta_1:=G\) and \(\Theta_{i+1}:=\Theta_i\times_HG\) for \(i\geq 1\). Then \(H\) is said to have combinatorial depth \(2i\geq 2\) if \(\Theta_{i+1}\) is isomorphic to a direct summand of \(a\Theta_i\) as a \(G\)-\(H\)-biset, for some positive integer \(a\). And \(H\) is said to have combinatorial depth \(2i+1\geq 1 \) if \(\Theta_{i+1}\) is isomorphic to a direct summand of \(a\Theta_i\) as an \(H\)-\(H\)-biset, for some positive integer \(a\). It is easy to see that combinatorial depth \(j\) always implies combinatorial depth \(j+1\). In the paper under review, the author considers the example \(G=\text{PSL}(2,q)\) where \(q\) is a prime power. He computes the minimal combinatorial depth \(d_c(H,G)\) for many subgroups \(H\) of \(G\) and obtains bounds for the remaining subgroups. For part I see J. Algebra 349, No. 1, 217-233 (2012; Zbl 1267.20011).