Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 5229
3 votes

Is Multilinear Hilbert's tenth problem version undecidable?

This is not an answer but a longish comment. There is no Hasse Principle for multilinear polynomials. Take for example the polynomial equation $$(5x+2)(5y+3)=11.$$ Evidently the equation has no integ …
Sidney Raffer's user avatar
11 votes
Accepted

Is equality of formulas with floor rounding or integer division decidable?

However it would be nice to know a simple elegant decidability result for formulas excluding division. …
Sidney Raffer's user avatar
13 votes
Accepted

Are the terms of a linear recurrence integral?

The problem is effectively decidable. To test whether $u_n$ is eventually integral, first use the recurrence relation for $u_n$ to construct relatively prime polynomials $A,B\in \mathbb{Z}[x]$ such th …
Sidney Raffer's user avatar
6 votes
2 answers
211 views

Algorithm for determining when polynomial iteration is bounded?

Let $f: \mathbb{Q}\to \mathbb{Q}$ be a polynomial map with rational coefficients. Let $p\in \mathbb{Q}^n$. Is there a known algorithm that given this data determines whether or not the iterates $f(p), …
11 votes
Accepted

Is equivalence of functions built from nested exponentiations a decidable problem?

The problem is effectively decidable, and we will describe an algorithm. By way of preparation, we need to mention the o-minimality of the real exponential field, and Wilkie's solution to Tarski's Hig …
Sidney Raffer's user avatar