101 research outputs found
Extending Elliptic Curve Chabauty to higher genus curves
We give a generalization of the method of "Elliptic Curve Chabauty" to higher
genus curves and their Jacobians. This method can sometimes be used in
conjunction with covering techniques and a modified version of the Mordell-Weil
sieve to provide a complete solution to the problem of determining the set of
rational points of an algebraic curve .Comment: 24 page
The moduli space of hypersurfaces whose singular locus has high dimension
Let be an algebraically closed field and let and be integers with
and Consider the moduli space of
hypersurfaces in of fixed degree whose singular locus is
at least -dimensional. We prove that for large , has a unique
irreducible component of maximal dimension, consisting of the hypersurfaces
singular along a linear -dimensional subspace of . The proof
will involve a probabilistic counting argument over finite fields.Comment: Final version, including the incorporation of all comments by the
refere
Visualizing elements of Sha[3] in genus 2 jacobians
Mazur proved that any element xi of order three in the Shafarevich-Tate group
of an elliptic curve E over a number field k can be made visible in an abelian
surface A in the sense that xi lies in the kernel of the natural homomorphism
between the cohomology groups H^1(k,E) -> H^1(k,A). However, the abelian
surface in Mazur's construction is almost never a jacobian of a genus 2 curve.
In this paper we show that any element of order three in the Shafarevich-Tate
group of an elliptic curve over a number field can be visualized in the
jacobians of a genus 2 curve. Moreover, we describe how to get explicit models
of the genus 2 curves involved.Comment: 12 page
A Local-Global Principle for Densities
Abstract. This expository note describes a method for computing densities of subsets of Zn described by infinitely many local conditions. 1
Tropical surface singularities
In this paper, we study tropicalisations of singular surfaces in toric
threefolds. We completely classify singular tropical surfaces of
maximal-dimensional type, show that they can generically have only finitely
many singular points, and describe all possible locations of singular points.
More precisely, we show that singular points must be either vertices, or
generalized midpoints and baricenters of certain faces of singular tropical
surfaces, and, in some cases, there may be additional metric restrictions to
faces of singular tropical surfaces.Comment: A gap in the classification was closed. 37 pages, 29 figure
Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers
We prove decidability of univariate real algebra extended with predicates for
rational and integer powers, i.e., and . Our decision procedure combines computation over real algebraic
cells with the rational root theorem and witness construction via algebraic
number density arguments.Comment: To appear in CADE-25: 25th International Conference on Automated
Deduction, 2015. Proceedings to be published by Springer-Verla
Proofs of the undecidability of stegananalysis techniques
Steganalysis comprises a set of techniques that strive to find concealed information within diverse types of digital media. On the contrary, Steganography involves a group of methods that, by manipulation of a cover object, aims to hide information to make it imperceptible. Current Steganalysis techniques suffer from a certain degree of failure in the detection of a payload and, frequently, the impossibility to discover if a media hides some information. In this chapter, we prove that the detection of hidden material within a media, or a Steganalysis procedure, is an undecidable problem. Our proof comprises two sets of tests: first, we demonstrate the undecidability by the principle of Diagonalization of Cantor, and second, we applied a reduction technique based on the undecidability of malware detection. For this part, we outline the hypothesis that there exists a similitude between Steganography techniques and the generation of an innocuous computer virus. Both demonstrations proved that Steganalysis procedures are undecidable problems
Undecidability in number theory
These lecture notes cover classical undecidability results in number theory,
Hilbert's 10th problem and recent developments around it, also for rings other
than the integers. It also contains a sketch of the authors result that the
integers are universally definable in the rationals.Comment: 48 pages. arXiv admin note: text overlap with arXiv:1011.342
Curves over every global field violating the local-global principle
There is an algorithm that takes as input a global field k and produces a
curve over k violating the local-global principle. Also, given a global field k
and a nonnegative integer n, one can effectively construct a curve X over k
such that #X(k)=n and X has points over every completion of k.Comment: 5 page
Complete intersections: Moduli, Torelli, and good reduction
We study the arithmetic of complete intersections in projective space over
number fields. Our main results include arithmetic Torelli theorems and
versions of the Shafarevich conjecture, as proved for curves and abelian
varieties by Faltings. For example, we prove an analogue of the Shafarevich
conjecture for cubic and quartic threefolds and intersections of two quadrics.Comment: 37 pages. Typo's fixed. Expanded Section 2.
- …