Return to Question

Is there any analogue of the method for expressing roots of polynomials of degree 5 with elliptic and η-functions that generalizes to polynomials of degrees n>5?

More specifically: does there exist any ''reasonable'' sequence of ''reasonable'' finite sets of ''reasonable'' special functions such that for arbitrary polynomial of degree d its roots are expressible by a unique term made out of coefficients of polynomial and functions from the d-th set?

By ''reasonable'' special functions I mean ones that has been investigated independently or have been already coined and are decently understood or are solutions to reasonable ODEs.

Are there some general results on restrictions to such sequence of special functions? Existence of integer solutions to polynomial equations is an undecidable problem. So if we replace ''reasonable'' by ''recursive'' and define ''reasonable special function'' as one defined by a power series with rational coefficients $(a_n)$ computably depending on $n$, then I imagine the answer might be 'no'. But no obvious prove comes to my head that such a family may not exist.

Is there any analogue of the method for expressing roots of polynomials of degree 5 with elliptic and η-functions that generalizes to polynomials of degrees n>5?

More specifically: does there exist any ''reasonable'' sequence of ''reasonable'' finite sets of ''reasonable'' special functions such that for arbitrary polynomial of degree d its roots are expressible by a unique term made out of coefficients of polynomial and functions from the d-th set?

By ''reasonable'' special functions I mean ones that has been investigated independently or have been already coined and are decently understood or are solutions to reasonable ODEs.

Are there some general results on restrictions to such sequence of special functions? Existence of integer solutions to polynomial equations is an undecidable problem. So if we replace ''reasonable'' by ''recursive'' and define ''reasonable special function'' as one defined by a power series with rational coefficients $(a_n)$ computably depending on $n$, then I imagine the answer might be 'no'. But no obvious proof comes to my mind that such a family may not exist.

Is there any analogue of the method for expressing roots of polynomials of degree 5 with elliptic and η-functions that generalizes to polynomials of degrees n>5?

More specifically: does there exist any ''reasonable'' sequence of ''reasonable'' finite sets of ''reasonable'' special functions such that for arbitrary polynomial of degree d its roots are expressible by a unique term made out of coefficients of polynomial and functions from the d-th set?

By ''reasonable'' special functions I mean ones that has been investigated independently or have been already coined and are decently understood or are solutions to reasonable ODEs.

Are there some known restrictions to such sequence of special functions? Since it is undecidable whether an arbitrary diophantine equation has a solution, then maybe if we replace ''reasonable'' by ''recursive'' and define ''reasonable special function'' as one defined by a power series with rational coefficients $(a_n)$ computably depending on $n$, then I imagine the answer might be 'no'. But no obvious prove comes to my head that such a family may not exist.

Is there any analogue of the method for expressing roots of polynomials of degree 5 with elliptic and η-functions that generalizes to polynomials of degrees n>5?

More specifically: does there exist any ''reasonable'' sequence of ''reasonable'' finite sets of ''reasonable'' special functions such that for arbitrary polynomial of degree d its roots are expressible by a unique term made out of coefficients of polynomial and functions from the d-th set?

By ''reasonable'' special functions I mean ones that has been investigated independently or have been already coined and are decently understood or are solutions to reasonable ODEs.

Are there some general results on restrictions to such sequence of special functions? Existence of integer solutions to polynomial equations is an undecidable problem. So if we replace ''reasonable'' by ''recursive'' and define ''reasonable special function'' as one defined by a power series with rational coefficients $(a_n)$ computably depending on $n$, then I imagine the answer might be 'no'. But no obvious prove comes to my head that such a family may not exist.

Does there exist any analogue of the method for solving quintic equtions for polynomials of degree $n > 5$? i. e. a method of expressing roots in terms of some reasonable special functions of coefficients in a computable way?

I know that 'reasonable' is extremely vague here. I mean functions which has been investigated in some other context or ones which fit into 'nice' families governed by parameters from $\mathbb{N}$, say, as solutions to a family of ODEs.

I suppose that the answer should be 'no', since otherwise no one would care about solutions to the polynomials of degree 5 with elliptic functions.

Is there any analogue of the method for expressing roots of polynomials of degree 5 with elliptic and η-functions that generalizes to polynomials of degrees n>5?

More specifically: does there exist any ''reasonable'' sequence of ''reasonable'' finite sets of ''reasonable'' special functions such that for arbitrary polynomial of degree d its roots are expressible by a unique term made out of coefficients of polynomial and functions from the d-th set?

By ''reasonable'' special functions I mean ones that has been investigated independently or have been already coined and are decently understood or are solutions to reasonable ODEs.

Are there some known restrictions to such sequence of special functions? Since it is undecidable whether an arbitrary diophantine equation has a solution, then maybe if we replace ''reasonable'' by ''recursive'' and define ''reasonable special function'' as one defined by a power series with rational coefficients $(a_n)$ computably depending on $n$, then I imagine the answer might be 'no'. But no obvious prove comes to my head that such a family may not exist.