Hidden Markov processes (HMPs) are important objects of study in many areas of pure and applied mathematics, including information theory, probability theory, dynamical systems and statistical physics, with applications in electrical engineering, computer science and molecular biology. This collection of research and survey papers presents important new results and open problems, serving as a unifying gateway for researchers in these areas. Based on talks given at the Banff International Research Station Workshop, 2007, this volume addresses a central problem of the subject: computation of the Shannon entropy rate of an HMP. This is a key quantity in statistical physics and information theory, characterizing the fundamental limit on compression and closely related to channel capacity, the limit on reliable communication. Also discussed, from a symbolic dynamics and thermodynamical viewpoint, is the problem of characterizing the mappings between dynamical systems which map Markov measures to Markov (or Gibbs) measures, and which allow for Markov lifts of Markov chains.

Elementary introduction to symbolic dynamics, updated to describe the main advances in the subject since the original publication in 1995.

This book brings the researcher up to date with recent applications of mathematical logic to number theory.

Crossing the boundary between differential and algebraic geometry in order to study singular spaces, this book introduces 'C∞-schemes with corners'.

A comprehensive collection of expository articles on cutting-edge topics at the forefront of research in algebraic geometry.

Describes how to use coherent sheaves and cohomology to prove combinatorial and number theoretical identities over finite fields.

This volume contains nine survey articles which provide expanded accounts of plenary seminars given at the British Combinatorial Conference at the University of Strathclyde in July 2017. This biennial conference is a well-established international event attracting speakers from around the world. Written by internationally recognised experts in the field, these articles represent a timely snapshot of the state of the art in the different areas of combinatorics. Topics covered include the robustness of graph properties, the spt-function of Andrews, switching techniques for edge decompositions of graphs, monotone cellular automata, and applications of relative entropy in additive combinatorics. The book will be useful to researchers and advanced graduate students, primarily in mathematics but also in computer science and statistics.

The area of computational cryptography is dedicated to the development of effective methods in algorithmic number theory that improve implementation of cryptosystems or further their cryptanalysis. This book is a tribute to Arjen K. Lenstra, one of the key contributors to the field, on the occasion of his 65th birthday, covering his best-known scientific achievements in the field. Students and security engineers will appreciate this no-nonsense introduction to the hard mathematical problems used in cryptography and on which cybersecurity is built, as well as the overview of recent advances on how to solve these problems from both theoretical and practical applied perspectives. Beginning with polynomials, the book moves on to the celebrated Lenstra-Lenstra-Lovász lattice reduction algorithm, and then progresses to integer factorization and the impact of these methods to the selection of strong cryptographic keys for usage in widely used standards.

Robert Langlands formulated his celebrated conjectures, initiating the Langlands Program, at the age of 31, profoundly changing the landscape of mathematics. Langlands, recipient of the Abel Prize, is famous for his insight in discovering links among seemingly dissimilar objects, leading to astounding results. This book is uniquely designed to serve a wide range of mathematicians and advanced students, showcasing Langlands' unique creativity and guiding readers through the areas of Langlands' work that are generally regarded as technical and difficult to penetrate. Part 1 features non-technical personal reflections, including Langlands' own words describing how and why he was led to formulate his conjectures. Part 2 includes survey articles of Langlands' early work that led to his conjectures, and centers on his principle of functoriality and foundational work on the Eisenstein series, and is accessible to mathematicians from other fields. Part 3 describes some of Langlands' contributions to mathematical physics.