I start my question with an example. Suppose $F/K$ be the function field generated by $x^n - yx^{n-1} - 1 = 0$. It is not a cyclic over K(y), but if I set $t = yx^{n-1}$ then we have $K(x,t) \subset K(x,y)$ and because $y = tx^{p-1}$ we have $K(x,y) = K(x,t)$. So if $K$ has $n$-th root of unity then $F$ is a Kummer extension over $K(t)$.

So, my question is what are the conditions that given $F/K$ defined by equation f(x,y) = 0, of genus $\ge 2$, there exits $t \in F$ such that $F/K(t)$ is Kummer (of degree $n$ for some $n$ such that $(n,\mathrm{char}(K))=1$ ), or is there an algorithm that can answer this question.

I know already one obvious necessary condition that $\mathrm{Aut}(F/K)$ should have a cyclic subgroup of order $n$ and that the co-factor subgroup should be a finite subgroup of $PGL(2, K)$, but is there something more that I should look for?

I think the question (as Felipe said) boils down to computing the genus of $F^{\mathcal{C}}$ for cyclic $\mathcal{C}<\mathrm{Aut}(F/K)$, but **is there a way to make sure that the genus of $F^{\mathcal{C}}$ is zero while avoiding the computation of the different (using only the group structure)**?

For example using Riemann-Hurwitz and choosing a large $n$ (say $n > \mathrm{Genus}(F))$ we can make sure that the $Genus(F^{\mathcal{C}}) \le 2$. But how can I decide between the 3 possibilities of $0, 1, 2$?

I mean if we are going to compute the different, then my answer will be "try to see if you can build a Kummer extension then your function field" is Kummer"! I would like to look at the group structure and be able to say something about this question (without carrying out a ramification inspection).

In special case, it's to see that which function with even order automorphism group is hyper elliptic. One necessary condition in that case is that the binary subgroup be in the centre (I don't know if it's sufficient). So, I would like to know if there's a similar conditions for Kummer extensions to decide about this problem without referring to the ramification structure.

Thank you very much indeed!