All Questions
3 questions
6
votes
1
answer
568
views
Is decomposability of integer polynomials over the rational numbers an undecidable problem?
By a decomposition of a polynomial $F(x)$ over a field $K$ we mean writing $F(x)$ as
$$
F(x)=G(H(x)) \quad(G(x), H(x) \in K[x]),
$$
which is nontrivial if $\operatorname{deg} G(x)>1$ and $\...
5
votes
0
answers
215
views
Integer points of rational function in 2 variables
Is there an algorithm that, given polynomials $P(x)$ and $Q(y)$ with integer coefficients, decides whether there exists integers $x$ and $y$ such that $\frac{P(x)}{Q(y)}$ is an integer?
This is a ...
1
vote
2
answers
191
views
Pseudo-decision procedures for first order arithmetic
I was reading this paper http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.117.2911&rep=rep1&type=pdf in which the author describes an algorithm, based on Groebner basis, ...