2 problems

Denef–Lipshitz conjecture on Diophantine definability of the integers
Sea $F$ un campo de números y sea $O_F$ su anillo de enteros. Un subconjunto de $O_F$ es diofantino si existe una ecuación polinómica con coeficientes en $O_F$ cuyos valores de las…
opendiophantine-definability hilbert-tenth-problem number-fields
0 responses
08
The cardinal-inequality realization conjecture for $cotimes$ graphs
Cardinal-inequality realization conjecture. For every algorithm $\mathcal{A}$ and input $x$ , there exists a $\otimes$ graph $\mathcal{G}$ with cardinal inequalities such that
opencomputability-theory graph-theory hilbert-tenth-problem
0 responses
06

Denef–Lipshitz conjecture on Diophantine definability of the integers