Cantitate/Preț
Produs

From Christoffel Words to Markoff Numbers

Autor Christophe Reutenauer
en Limba Engleză Hardback – 20 noi 2018
In 1875, Elwin Bruno Christoffel introduced a special class of words on a binary alphabet linked to continued fractions which would go onto be known as Christoffel words. Some years later, Andrey Markoff published his famous theory, the now called Markoff theory. It characterized certain quadratic forms and certain real numbers by extremal inequalities. Both classes are constructed using certain natural numbers — known as Markoff numbers — and they are characterized by a certain Diophantine equality. More basically, they are constructed using certain words — essentially the Christoffel words. The link between Christoffel words and the theory of Markoff was noted by Ferdinand Frobenius in 1913, but has been neglected in recent times. Motivated by this overlooked connection, this book looks to expand on the relationship between these two areas. Part 1 focuses on the classical theory of Markoff, while Part II explores the more advanced and recent results of the theory of Christoffel words.
Citește tot Restrânge

Preț: 59009 lei

Preț vechi: 80677 lei
-27% Nou

Puncte Express: 885

Preț estimativ în valută:
11297 11742$ 9366£

Carte tipărită la comandă

Livrare economică 27 ianuarie-01 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780198827542
ISBN-10: 0198827547
Pagini: 170
Ilustrații: 26
Dimensiuni: 164 x 236 x 14 mm
Greutate: 0.43 kg
Editura: OUP OXFORD
Colecția OUP Oxford
Locul publicării:Oxford, United Kingdom

Recenzii

For the first time in literature on the subject, this textbook treats the two aspects of Markoff's Theory simultaneously. Numerous figures throughout the book help to illustrate its points and provide proofs of discrete geometry.
This book is a well-written introduction to a fascinating subtopic in mathematics that should be accessible to a graduate student or a research mathematician. Most subsections are a few pages in length, easily digestible in a brief time. The proofs are concise, but with enough detail to satisfy the reader.

Notă biografică

Christophe Reutenauer was educated at the Université Paris in 1977 before going on to complete his doctorate thesis at the same institution in 1980. He was a former researcher at CNRS (Centre National de la Recherche Scientifique) in Paris and LITP (Laboratoire d'Informatique Théorique et de Programmation) from 1976 to 1990.Reutenauer has, from 1985, been a professor at UQAM (Université du Québec à Montréal), and was also a professor at the University of Strasbourg between 1999 and 2001. Since then, he has been an invited professor or researcher at several universities, including Saarbrücken, Darmstadt, Roma, Napoli, Palermo, UQAM, San Diego (UCSD), Strasbourg, Montpelier, Bordeaux, Paris-Est, Nice, and the Mittag-Leffler Institute. He was also the Canadian Research Chair for "Algebra, Combinatorics and mathematical Informatics" between 2001 and 2015.