Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe local-global principle for integral points on stacky curves
82
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We construct a stacky curve of genus $1/2$ (i.e., Euler characteristic $1$) over $mathbb{Z}$ that has an $mathbb{R}$-point and a $mathbb{Z}_p$-point for every prime $p$ but no $mathbb{Z}$-point. This is best possible: we also prove that any stacky curve of genus less than $1/2$ over a ring of $S$-integers of a global field satisfies the local-global principle for integral points.
rate research
Read More
We provide in this paper an upper bound for the number of rational points on a curve defined over a one variable function field over a finite field. The bound only depends on the curve and the field, but not on the Jacobian variety of the curve.
In order to study integral points of bounded log-anticanonical height on weak del Pezzo surfaces, we classify weak del Pezzo pairs. As a representative example, we consider a quartic del Pezzo surface of singularity type $mathbf{A}_1+mathbf{A}_3$ and prove an analogue of Manins conjecture for integral points with respect to its singularities and its lines.
Let F be a function field in one variable over a p-adic field and D a central division algebra over F of degree n coprime to p. We prove that Suslin invariant detects whether an element in F is a reduced norm. This leads to a local-global principle for reduced norms with respect to all discrete valuations of F.
We describe the practical implementation of an average polynomial-time algorithm for counting points on superelliptic curves defined over $mathbb Q$ that is substantially faster than previous approaches. Our algorithm takes as input a superelliptic curves $y^m=f(x)$ with $mge 2$ and $fin mathbb Z[x]$ any squarefree polynomial of degree $dge 3$, along with a positive integer $N$. It can compute $#X(mathbb F_p)$ for all $ple N$ not dividing $mmathrm{lc}(f)mathrm{disc}(f)$ in time $O(md^3 Nlog^3 Nloglog N)$. It achieves this by computing the trace of the Cartier--Manin matrix of reductions of $X$. We can also compute the Cartier--Manin matrix itself, which determines the $p$-rank of the Jacobian of $X$ and the numerator of its zeta function modulo~$p$.
In 1922, Mordell conjectured the striking statement that for a polynomial equation $f(x,y)=0$, if the topology of the set of complex number solutions is complicated enough, then the set of rational number solutions is finite. This was proved by Faltings in 1983, and again by a different method by Vojta in 1991, but neither proof provided a way to provably find all the rational solutions, so the search for other proofs has continued. Recently, Lawrence and Venkatesh found a third proof, relying on variation in families of $p$-adic Galois representations; this is the subject of the present exposition.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
