相关论文: On relative computability for curves

We answer some enumerative questions about irreducible rational curves on Hirzebruch surfaces, by combining an idea of Kontsevich with the study of the geometry of certain natural parameter spaces. Our formulas generalize Kontsevich's…

In this short note we give an elementary combinatorial argument, showing that the Conjecture of J. Fern\'andez de Bobadilla, I. Luengo, A. Melle-Hern\'andez, A. N\'emethi follows from the results of M. Borodzik and C. Livingston in the case…

We study the density of solutions to Diophantine inequalities involving non-singular ternary forms, or equivalently, the density of rational points close to non-singular plane algebraic curves.

As one of the seven open problems in the addendum to their 1989 book "Computability in Analysis and Physics", Pour-El and Richards proposed ``... the recursion theoretic study of particular nonlinear problems of classical importance.…

Julia Robinson has given a first-order definition of the rational integers Z in the rational numbers Q by a formula (\forall \exists \forall \exists)(F=0) where the \forall-quantifiers run over a total of 8 variables, and where F is a…

The systems of complex analytic second order ordinary differential equations whose solutions close up to become rational curves (after analytic continuation) are characterized by the vanishing of an explicit differential invariant, and turn…

A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…

We consider a Bertrand type estimate for primes splitting completely. As one of its applications, we show the finiteness of trivial solutions of Diophantine equation about the factorial function over number fields except for the case the…

In this article we prove the explicit Mordell Conjecture for large families of curves. In addition, we introduce a method, of easy application, to compute all rational points on curves of quite general shape and increasing genus. The method…

We investigate approximation to a given real number by algebraic numbers and algebraic integers of prescribed degree. We deal with both best and uniform approximation, and highlight the similarities and differences compared with the…

We relate a previous result of ours on families of Diophantine equations having only trivial solutions with a result on the approximation of an algebraic number by products of rational numbers and units. We compare this approximation with a…

In this paper, by using the theory of elliptic curves, we discuss several Diophantine equations related with the so-called figurate primes. Meanwhile, we raise several conjectures related with figurate primes and Hilbert's 8th problem,…

We obtain computational hardness results for f-vectors of polytopes by exhibiting reductions of the problems DIVISOR and SEMI-PRIME TESTABILITY to problems on f-vectors of polytopes. Further, we show that the corresponding problems for…

Any counterexample to the two-dimensional Jacobian Conjecture gives a rational map from one projective plane to another. We use some ideas of the Minimal Model Program to study the combinatorial structure of a rational surface, that is…

We show that elliptic curves whose Mordell-Weil groups are finitely generated over some infinite extensions of $\Q$, can be used to show the Diophantine undecidability of the rings of integers and bigger rings contained in some infinite…

S. Lang conjectured in 1974 that a hyperbolic algebraic variety defined over a number field has only finitely many rational points, and its analogue over function fields. We discuss the Nevanlinna-Cartan theory over function fields of…

Many questions about triangles and quadrilaterals with rational sides, diagonals and areas can be reduced to solving certain Diophantine equations. We look at a number of such questions including the question of approximating arbitrary…

For a linear difference equation with the coefficients being computable sequences, we establish algorithmic undecidability of the problem of determining the dimension of the solution space including the case when some additional prior…

Let $X/C$ be a general product of elliptic curves. Our goal is to establish the Hodge-D-conjecture for $X$. We accomplish this when $\dim X \leq 5$. For $\dim X \geq 6$, we reduce the conjecture to a matrix rank condition that is amenable…

We prove upper bounds on the number of rational points on transcendental curves in arbitrary $1$-h-minimal fields, similar to the Pila--Wilkie counting theorem in the o-minimal setting. These results extend results due to…