The Mordell Conjecture

The Mordell conjecture (Faltings's theorem) is one of the most important achievements in Diophantine geometry, stating that an algebraic curve of genus at least two has only finitely many rational points. This book provides a self-contained and detailed proof of the Mordell conjecture following the papers of Bombieri and Vojta. Also acting as a concise introduction to Diophantine geometry, the text starts from basics of algebraic number theory, touches on several important theorems and techniques (including the theory of heights, the Mordell–Weil theorem, Siegel's lemma and Roth's lemma) from Diophantine geometry, and culminates in the proof of the Mordell conjecture. Based on the authors' own teaching experience, it will be of great value to advanced undergraduate and graduate students in algebraic geometry and number theory, as well as researchers interested in Diophantine geometry as a whole.

Solving Diophantine Equations by Factoring in Number Fields

In this text we provide an introduction to algebraic number theory and show its applications in solving certain difficult diophantine equations. We begin with a quick summary of the theory of quadratic residues, before diving into a select few areas of algebraic number theory. Our article is accompanied by a couple of worked problems and exercises for the reader to tackle on their own.

On the Irreducible Factors of a Polynomial and Applications to Extensions of Absolute Values

Polynomial factorization over a field is very useful in algebraic number theory, in extensions of valuations, etc. For valued field extensions, the determination of irreducible polynomials was the focus of interest of many authors. In 1850, Eisenstein gave one of the most popular criterion to decide on irreducibility of a polynomial over Q. A criterion which was generalized in 1906 by Dumas. In 2008, R. Brown gave what is known to be the most general version of Eisenstein-Schönemann irreducibility criterion. Thanks to MacLane theory, key polynomials play a key role to extend absolute values. In this chapter, we give a sufficient condition on any monic plynomial to be a key polynomial of an absolute value, an irreducibly criterion will be given, and for any simple algebraic extension L=Kα, we give a method to describe all absolute values of L extending ∣∣, where K is a discrete rank one valued field.

Weierstrass points on modular curves X0(N) fixed by the Atkin–Lehner involutions

PurposeThe authors have determined whether the points fixed by all the full and the partial Atkin–Lehner involutions WQ on X0(N) for N ≤ 50 are Weierstrass points or not.Design/methodology/approachThe design is by using Lawittes's and Schoeneberg's theorems.FindingsFinding all Weierstrass points on X0(N) fixed by some Atkin–Lehner involutions. Besides, the authors have listed them in a table.Originality/valueThe Weierstrass points have played an important role in algebra. For example, in algebraic number theory, they have been used by Schwartz and Hurwitz to determine the group structure of the automorphism groups of compact Riemann surfaces of genus g ≥ 2. Whereas in algebraic geometric coding theory, if one knows a Weierstrass nongap sequence of a Weierstrass point, then one is able to estimate parameters of codes in a concrete way. Finally, the set of Weierstrass points is useful in studying arithmetic and geometric properties of X0(N).

Neural Cryptography Based on Generalized Tree Parity Machine for Real-Life Systems

Traditional public key exchange protocols are based on algebraic number theory. In another perspective, neural cryptography, which is based on neural networks, has been emerging. It has been reported that two parties can exchange secret key pairs with the synchronization phenomenon in neural networks. Although there are various models of neural cryptography, called Tree Parity Machine (TPM), many of them are not suitable for practical use, considering efficiency and security. In this paper, we propose a Vector-Valued Tree Parity Machine (VVTPM), which is a generalized architecture of TPM models and can be more efficient and secure for real-life systems. In terms of efficiency and security, we show that the synchronization time of the VVTPM has the same order as the basic TPM model, and it can be more secure than previous results with the same synaptic depth.

On the generalization of Inoue manifolds

This paper is about a generalization of celebrated Inoue's surfaces. To each matrix M in SL(2n+1,ℤ) we associate a complex non-Kähler manifold TM of complex dimension n+1. This manifold fibers over S1 with the fiber T2n+1 and monodromy MT. Our construction is elementary and does not use algebraic number theory. We show that some of the Oeljeklaus-Toma manifolds are biholomorphic to the manifolds of type TM. We prove that if M is not diagonalizable, then TM does not admit a Kähler structure and is not homeomorphic to any of Oeljeklaus-Toma manifolds.