相关论文: On relative computability for curves
We prove two related concentration inequalities concerning the number of rational points of hyperelliptic curves over subsets of a finite field. In particular, we investigate the probability of a large discrepancy between the numbers of…
Using continuation methods, we study the global solution structure of periodic solutions for a class of periodically forced equations, generalizing the case of relativistic pendulum. We obtain results on the existence and multiplicity of…
In this paper, we consider a problem of Lang about finiteness of torsion points on plane rational curves over $\mathbb C$, and prove some results towards a matrix analogue of this problem.
This paper argues that the requirement of applicableness of quantum linearity to any physical level from molecules and atoms to the level of macroscopic extensional world, which leads to a main foundational problem in quantum theory…
Diophantine approximation is traditionally the study of how well real numbers are approximated by rationals. We propose a model for studying Diophantine approximation in an arbitrary totally bounded metric space where the rationals are…
We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…
We present here quantitative versions in 1 dimension of Faltings'theorem according to which the set of the K-rational points (where K is a given number field) of an abelian variety A definied over K, which are close (with respect to a…
Vop\v{e}nka's Alternative Set Theory has been considered as a framework for modelling vague notions. This paper takes feasibility, pertaining to numbers as per some of Yessenin-Volpin's work, and tries to assess how this notion could be…
We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…
We study decidability and complexity questions related to a continuous analogue of the Skolem-Pisot problem concerning the zeros and nonnegativity of a linear recurrent sequence. In particular, we show that the continuous version of the…
An elliptic divisibility sequence, generated by a point in the image of a rational isogeny, is shown to possess a uniformly bounded number of prime terms. This result applies over the rational numbers, assuming Lang's conjecture, and over…
We prove a dynamical Shafarevich theorem on the finiteness of the set of isomorphism classes of rational maps with fixed degeneracies. More precisely, fix an integer d at least 2 and let K be either a number field or the function field of a…
For K \subseteq C, let B_n(K)={(x_1,...,x_n) \in K^n: for each y_1,...,y_n \in K the conjunction (\forall i \in {1,...,n} (x_i=1 => y_i=1)) AND (\forall i,j,k \in {1,...,n} (x_i+x_j=x_k => y_i+y_j=y_k)) AND (\forall i,j,k \in {1,...,n}…
We study the number of rational points of smooth projective curves over finite fields in some relative situations in the spirit of a previous paper from an euclidean point of vue. We prove some kinds of relative Weil bounds, derived from…
In this article, we establish an analogue of the dimension growth conjecture, which is regarding the density of rational points on projective varieties, for compact submanifolds of $\mathbb{R}^n$ with non-vanishing curvature. We also…
Among the set of hypersurfaces of degree $d$ and dimension $\ell$ defined by the vanishing of a homogeneous polynomial with coefficients $\pm 1$, we investigate the probability that a hypersurface contains a rational point as $d$ and $\ell$…
Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and…
We show that determining Kapranov rank of tropical matrices is not only NP-hard over any infinite field but also if solving Diophantine equations over the rational numbers is undecidable, then determining Kapranov rank over the rational…
By the theory of elliptic curves, we study the nontrivial rational parametric solutions and rational solutions of the Diophantine equations $z^2=f(x)^2 \pm g(y)^2$ for some simple Laurent polynomials $f$ and $g$.
The ancient unsolved problem of congruent numbers has been reduced to one of the major questions of contemporary arithmetic: the finiteness of the number of curves over $\bf Q$ which become isomorphic at every place to a given curve. We…