Related papers: Note on a theorem of Professor X

Mordell equations are celebrated equations within number theory and are named after Louis Mordell, an American-born British mathematician, known for his pioneering research in number theory. In this paper, we discover all Mordell equations…

Assuming that there exist (infinitely many) Siegel zeros, we show that the (Rosser-)Jurkat-Richert bounds in the linear sieve cannot be improved, and similarly look at Iwaniec's lower bound on Jacobsthal's problem, as well as minor…

We prove the first known nontrivial bounds on the sizes of the 2-torsion subgroups of the class groups of cubic and higher degree number fields $K$ (the trivial bound being $O_{\epsilon}(|{\rm Disc}(K)|^{1/2+\epsilon})$ by Brauer--Siegel).…

We push further the classical proof of Weil upper bound for the number of rational points of an absolutely irreducible smooth projective curve $X$ over a finite field in term of euclidean relationships between the Neron Severi classes in…

Conditionally on the Riemann Hypothesis we obtain bounds of the correct order of magnitude for the 2k-th moment of the Riemann zeta-function for all positive real k < 2.181. This provides for the first time an upper bound of the correct…

It is a well-known conjecture, sometimes attributed to Frankl, that for any family of sets which is closed under the union operation, there is some element which is contained in at least half of the sets. Gilmer was the first to prove a…

We prove two unconditional upper bounds on the gaps between ordinates of consecutive non-trivial zeros of a general $L$-function $L(s)$. This extends previous work of Hall and Hayman (2000) on the Riemann zeta-function and work of Siegel…

We review a finite-sampling exponential bound due to Serfling and discuss related exponential bounds for the hypergeometric distribution. We then discuss how such bounds motivate some new results for two-sample empirical processes. Our…

In 1922, Mordell conjectured that the set of rational points on a smooth curve $C$ over $\mathbb{Q}$ with genus $g \ge 2$ is finite. This has been proved by Faltings in 1983. However, Coleman determined in 1985 an upper bound of…

Weil's theorem gives the most standard bound on the number of points of a curve over a finite field. This bound was improved by Ihara and Oesterl\'e for larger genus. Recently, Hallouin and Perret gave a new point of view on these bounds,…

In 1985, Yu. V. Nesterenko produced a criterion for linear independence, which is a variant of Siegel's. While Siegel uses upper bounds on full systems of forms, Nesterenko uses upper and lower bounds on sufficiently dense sequences of…

We show that there is a bound depending only on g and [K:Q] for the number of K-rational points on a hyperelliptic curve C of genus g over a number field K such that the Mordell-Weil rank r of its Jacobian is at most g-3. If K = Q, an…

Consider a modular curve $X_G$ defined over a number field $K$, where $G$ is a subgroup of $GL_2(\mathbb{Z}/N\mathbb{Z})$ with $N>2$. The curve $X_G$ comes with a morphism $j: X_G\to \mathbb{P}^1_K=\mathbb{A}^1_K \cup\{\infty\}$ to the…

We prove two bounds for discrete moments of Weyl sums. The first one can be obtained using a standard approach. The second one involves an observation how this method can be improved, which leads to a sharper bound in certain ranges. The…

Putinar's Positivstellensatz is a central theorem in real algebraic geometry. It states the following: If you have a set $S= \{ x \in R^n \ | \ g_1 (x) \geq 0, ... , g_m(x) \geq 0\}$ described by some real polynomials $g_i$, then every real…

Consider an elliptic curve, defined over the rational numbers, and embedded in projective space. The rational points on the curve are viewed as integer vectors with coprime coordinates. What can be said about a rational point if a bound is…

We establish an effective version of Siegel's lower bounds for class numbers of imaginary quadratic fields in certain cures in $Y(1)^n$. Our proof goes through the G-functions method of Yves Andr\'e.

In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW) proved a hardness result for several fundamental graph problems in the LOCAL model: For any (randomized) algorithm, there are input graphs with $n$ nodes and maximum…

Siegel in 1932 published a paper on Riemann's posthumous writings, including a study of the Riemann-Siegel formula. In this paper we explicitly give the asymptotic developments of $\mathop{\mathcal R }(s)$ suggested by Siegel. We extend the…

An open problem that is widely regarded as one of the most important in quantum query complexity is to resolve the quantum query complexity of the k-distinctness function on inputs of size N. While the case of k=2 (also called Element…