Bookbot

The Surprising Mathematics of Longest Increasing Subsequences

Autorzy

Ocena książki

Parametry

  • 366 stron
  • 13 godzin czytania

Więcej o książce

Delving into the longest increasing subsequence problem, this book uncovers its profound links to diverse mathematical fields, including random permutations and matrices. It offers a playful exploration of significant theorems such as the Vershik-Kerov-Logan-Shepp limit shape theorem and the Tracy-Widom distribution, making complex concepts approachable for graduate students. By connecting probability and combinatorics, it serves as an engaging introduction to elegant mathematical ideas relevant to mathematicians, computer scientists, and statisticians alike.

Wydanie

Zakup książki

The Surprising Mathematics of Longest Increasing Subsequences, Dan Romik

Język
Rok wydania
2015
Oprawa
(miękka)
Jak tylko się pojawi, wyślemy Ci wiadomość e-mail.

Metody płatności

5,0
Doskonała
1 Ocena

Brakuje nam tutaj Twojej recenzji.

Tytuł
The Surprising Mathematics of Longest Increasing Subsequences
Język
angielski
Autorzy
Dan Romik
Rok wydania
2015
Oprawa
miękka
Liczba stron
366
ISBN13
9781107428829
Tagi
Ocena
5 z 5
Opis
Delving into the longest increasing subsequence problem, this book uncovers its profound links to diverse mathematical fields, including random permutations and matrices. It offers a playful exploration of significant theorems such as the Vershik-Kerov-Logan-Shepp limit shape theorem and the Tracy-Widom distribution, making complex concepts approachable for graduate students. By connecting probability and combinatorics, it serves as an engaging introduction to elegant mathematical ideas relevant to mathematicians, computer scientists, and statisticians alike.