Skip to main content
added tag of decidability, readded tags of number theory and arithmetic geometry; left off algebraic geometry, which is tangential by comparison with the others
Link
user44143
user44143
edited title
Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76

Is Multilinear Hilbert's tenth problem isversion undecidable for multilinear polynomials?

Rollback to Revision 4
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76

Is Hilbert's tenth problem is undecidable for multilinear polynomials in $\mathbb Z[x_1,\dots,x_n]$?

A multilinear polynomial $f\in\mathbb Z[x_1,\dots,x_t]$ has terms only of form $$b\prod_{i=1}^tx_i^{a_i}$$ where $a_i\in\{0,1\}$ and $b\in\mathbb Z$.

Denote the following problem Multilinear Hilbert Tenth Problem.

Given $f$ is there a computable bound $0<d<\infty$ such that

$$\{(x_1,\dots,x_t)\in\mathbb Z^n\wedge\|(x_1,\dots,x_n)\|_\infty\leq d\implies f(x_1,\dots,x_n)\neq0\}\iff\{\forall(x_1,\dots,x_n)\in\mathbb Z^n\mbox{ }f(x_1,\dots,x_n)\neq0\}$$ holds?

$\underline{General\mbox{ }Conjecture}$: There is such computable $d$.

Is the $\underline{General\mbox{ }Conjecture}$there no general purpose algorithm for Multilinear Hilbert Tenth Problem truefinding integer roots of this class of polynomials?

Is Hilbert's tenth problem undecidable for multilinear polynomials in $\mathbb Z[x_1,\dots,x_n]$?

A multilinear polynomial $f\in\mathbb Z[x_1,\dots,x_t]$ has terms only of form $$b\prod_{i=1}^tx_i^{a_i}$$ where $a_i\in\{0,1\}$ and $b\in\mathbb Z$.

Denote the following problem Multilinear Hilbert Tenth Problem.

Given $f$ is there a computable bound $0<d<\infty$ such that

$$\{(x_1,\dots,x_t)\in\mathbb Z^n\wedge\|(x_1,\dots,x_n)\|_\infty\leq d\implies f(x_1,\dots,x_n)\neq0\}\iff\{\forall(x_1,\dots,x_n)\in\mathbb Z^n\mbox{ }f(x_1,\dots,x_n)\neq0\}$$ holds?

$\underline{General\mbox{ }Conjecture}$: There is such computable $d$.

Is the $\underline{General\mbox{ }Conjecture}$ for Multilinear Hilbert Tenth Problem true?

Hilbert's tenth problem is undecidable for multilinear polynomials?

A multilinear polynomial $f\in\mathbb Z[x_1,\dots,x_t]$ has terms only of form $$b\prod_{i=1}^tx_i^{a_i}$$ where $a_i\in\{0,1\}$ and $b\in\mathbb Z$.

Is there no general purpose algorithm for finding integer roots of this class of polynomials?

deleted 286 characters in body; edited title
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76
Loading
deleted 121 characters in body
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76
Loading
added 128 characters in body
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76
Loading
added 8 characters in body
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76
Loading
added 66 characters in body
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76
Loading
added 247 characters in body; edited tags; edited title
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76
Loading
Rewrote title
Link
YCor
  • 63.9k
  • 5
  • 187
  • 286
Loading
deleted 187 characters in body
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76
Loading
added 183 characters in body
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76
Loading
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76
Loading