The Voynich Manuscript is an undeciphered document from medieval Europe. We present current knowledge about the manuscript’s text through a series of questions about its linguistic properties.

The statistical properties of letters frequencies in European literature texts are investigated. The determination of logarithmic dependence of letters sequence for one-language and twolanguage texts are examined. The pare of languages is suggested for Voynich Manuscript. The internal structure of Manuscript is considered. The spectral portraits of two-letters distribution are constructed.

The Voynich Manuscript is a medieval book written in an unknown script. This paper studies the distribution of similarly spelled words in the Voynich Manuscript. It shows that the distribution of words within the manuscript is not compatible with natural languages.

The Voynich manuscript is a medieval book written in an unknown script. This paper studies the relation between similarly spelled words in the Voynich manuscript. By means of a detailed analysis of similar spelled words it was possible to reveal the text generation method used for the Voynich manuscript.

The Voynich manuscript (VMS) is the book dated as 15 th-16 th century, written using specific and smart coding methods. This article describes the methods how it was analyzed and how coding keys were found. It is also shows the VMS author's method of coding.

Fröhlich suggested considering invariants of ON together with the trace pairing (x, y) → TrN/Q(xy). This leads to local and global Hermitian discriminants of (ON, Tr) in “Hermitian classgroups.” Cassou-Noguès and Taylor showed these discriminants were enough to determine both local and global symplectic root numbers. This approach will be generalized to projective schemes over Z in lecture 3. O...

Literature Review (LR) and Manuscript Preparatory (MP) tasks are two key activities for researchers. While process-based and technologicaloriented interventions have been introduced to bridge the apparent gap between novices and experts for LR tasks, there are very few approaches for MP tasks. In this paper, we introduce a novel task of shortlisting important papers from the reading list of res...

Algorithmic decipherment is a prime example of a truly unsupervised problem. The first step in the decipherment process is the identification of the encrypted language. We propose three methods for determining the source language of a document enciphered with a monoalphabetic substitution cipher. The best method achieves 97% accuracy on 380 languages. We then present an approach to decoding ana...

The aim of this project is to research the possibilities of applying unsupervised learning techniques for natural language and other sequential data to undeciphered texts and manuscripts. The undeciphered text used is the Voynich Manuscript, a mysterious book from the 15th or 16th century that is written in an unknown script. Some methods that could be applied to manuscripts such as these will ...

Introduction 2 1. The Group Law on Pell Conics and Elliptic Curves 2 1.1. Group Law on Conics 2 1.2. Group Law on Elliptic curves 3 2. The Group Structure 3 2.1. Finite Fields 3 2.2. p-adic Numbers 3 2.3. Integral and Rational Points 4 3. Applications 4 3.1. Primality Tests 4 3.2. Factorization Methods 5 4. 2-Descent 5 4.1. Selmer and Tate-Shafarevich Group 5 4.2. Heights 6 5. Analytic Methods ...