MHB Differential equations - Decidability and Complexity

Click For Summary
The discussion revolves around the decidability and complexity of linear differential equations with polynomial coefficients. Participants inquire about the existence of algorithms to determine solution existence and linear independence. There is a specific interest in whether these problems relate to Hilbert's 10th problem. The need for clarity on the complexity of these problems is emphasized, particularly regarding polynomial time algorithms. Overall, the conversation seeks deeper insights and resources on the topic.
mathmari
Gold Member
MHB
Messages
4,984
Reaction score
7
Hey! :o

Is someone familiar with the following?

We have linear differential equations with polynomial coefficients depending on x.

$a_n(x)y^{(n)}+ \dots a_1(x)y^{(1)}+a_0(x)y^{(0)}=b(x)$

There are problems like if there are solutions, if the solutions are linear independent and so on and we are looking for the decidability and the complexity.
 
Physics news on Phys.org
Hi,

I'm not too much familiar with this questions, but ... don't you need an algorithm to talk about the complexity? Or are you asking about the existence of a polynomial time algorithm?
 
First of all, I am asking if someone is familiar with the decidability of such problems.

Are you familiar with that?
 
One such problem is the following:

View attachment 4527

Do you maybe know where I can get more information?
 

Attachments

  • diff.PNG
    diff.PNG
    36.9 KB · Views: 107
Is this related to the 10th problem of Hilbert?
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 3 ·
Replies
3
Views
939
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K