Is there a function $f : \mathbb{N} \rightarrow \mathbb{N}$ such that for each finite supersolvable group $G$, and a Sylow subgroup $S \leq G$ we have $d(S) \leq f(d(G))$?


Here $d(H)$ denotes the minimal cardinality of a generating set of a group $H$. It is enough to consider the case of $G$ having a trivial Frattini subgroup.


In the language of profinite groups, an equivalent reformulation would be:


Let $F$ be a free finitely generated nonabelian prosupersolvable group. Is there a bound on the number of generators of the Sylow subgroups of $F$? (the sylow subgroups must be finitely generated by a theorem of Oltikar and Ribes).



Generators of Sylow subgroups
I don't think so. Let $p$ and $q$ be primes with $q|p-1$. Then there are $q$ inequivalent $1$-dimensional modules for $C\_q$ over ${\mathbb F}\_p$, If we take the semidirect product of the direct sum of these modules by $C\_q$, then we get a supersolvable group $G$ of order $p^qq$ with $d(G)=2$, with an elementary abelian Sylow $p$-subgroup $P$ of order $p^q$, so $d(P)=q$.
In terms of presentations, suppose that $\langle x,y \mid x^p=y^q=1, x^y=x^a \rangle$ is a presentation of a nonabelian group of order $pq$. Then we can take


$$G = \langle x\_i,y \mid y^q=1, x\_i^p=1, [x\_i,x\_j]=1, x\_i^y = x\_i^{a^i} \rangle$$


where $1 \le i,j \le q$. Then $G = \langle x\_1x\_2 \cdots x\_q, y \rangle$, so $d(G)=2$.


PS: in fact there is no need to assume that $q$ is prime.


