Related papers: On relative computability for curves
Myasnikov, Ushakov, and Won introduced power circuits in 2012 to construct a polynomial-time algorithm for the word problem in the Baumslag group, which has a non-elementary Dehn function. Power circuits are computational structures that…
We study the relationship between the solvability of the $L^p$ Dirichlet problem $(D)_p$ and that of the $L^q$ regularity problem $(R)_q$ for second order elliptic equations with bounded measurable coefficients. It is known that the…
In recent publications in physics and mathematics, concerns have been raised about the use of real numbers to describe quantities in physics, and in particular about the usual assumption that physical quantities are infinitely precise. In…
Functions with singularities are notoriously difficult to approximate with conventional approximation schemes. In computational applications, they are often resolved with low-order piecewise polynomials, multilevel schemes, or other types…
We discuss several open problems in Diophantine approximation. Among them there are famous Littlewood's and Zaremba's conjectures as well as some new and not so famous problems.
Let f(n)=1 if n=1, 2^(2^(n-2)) if n \in {2,3,4,5}, (2+2^(2^(n-4)))^(2^(n-4)) if n \in {6,7,8,...}. We conjecture that if a system T \subseteq {x_i+1=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in positive…
We give an alternative proof of Faltings's theorem (Mordell's conjecture): a curve of genus at least two over a number field has finitely many rational points. Our argument utilizes the set-up of Faltings's original proof, but is in spirit…
Let $A,B,C,D$ be rational numbers such that $ABC \neq 0$, and let $n_1>n_2>n_3>0$ be positive integers. We solve the equation $$ Ax^{n_1}+Bx^{n_2}+Cx^{n_3}+D = f(g(x)),$$ in $f,g \in \mathbb{Q}[x]$. In sequel we use Bilu-Tichy method to…
Denoting by ${\mathcal L}_d(m_0,m_1,...,m_r)$ the linear system of plane curves passing through $r+1$ generic points $p_0,p_1,...,p_r$ of the projective plane with multiplicity $m_i$ (or larger) at each $p_i$, we prove the…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
In this paper, the elliptic curves theory is used for solving the Diophantine equations $\sum_{i=1}^n a_ix_{i} ^6+\sum_{i=1}^m b_iy_{i} ^3= \sum_{i=1}^na_iX_{i}^6\pm\sum_{i=1}^m b_iY_{i} ^3$, where $n$, $m$ $\geq 1$ and $a_i$, $b_i$, are…
For a given irrational number, we consider the properties of best rational approximations of given parities. There are three different kinds of rational numbers according to the parity of the numerator and denominator, say odd/odd, even/odd…
In this paper we adopt a geometric point of view regarding a famous conjecture due to Littlewood in diophantine approximation of real numbers. Following the spirit of the geometric theory of continued fractions, we give a sufficient…
We prove new results, related to the Littlewood and Mixed Littlewood conjectures in Diophantine approximation.
Based on the MRDP theorem, we introduce the ideas of the proof equation of a formula and universal proof equation of Peano Arithmetic (PA); and then, combining universal proof equation and G\"odel's Second Incompleteness Theorem, it is…
On the real numbers, the notions of a semi-decidable relation and that of an effectively enumerable relation differ. The second only seems to be adequate to express, in an algorithmic way, non deterministic physical theories, where…
We prove the finiteness of relative log pluricanonical representations in the complex analytic setting. As an application, we discuss the abundance conjecture for semi-log canonical pairs within this framework. Furthermore, we establish the…
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum class BQP. 1. BQP is low for PP, i.e.,…
Watkins's conjecture suggests that for an elliptic curve $E/\mathbb{Q}$, the rank of the group $E(\mathbb{Q})$ of rational points is bounded above by $\nu_2 (m_E)$, where $m_E$ is the modular degree associated with $E$. It is known that…
Consider the classical problem of rational simultaneous approximation to a point in $\mathbb{R}^{n}$. The optimal lower bound on the gap between the induced ordinary and uniform approximation exponents has been established by Marnat and…