東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

The Surprising mathematics of longes...

Romik, Dan, (1976-)

FindBook

Google Book

Amazon

博客來

The Surprising mathematics of longest increasing subsequences /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	The Surprising mathematics of longest increasing subsequences // Dan Romik.
作者:	Romik, Dan,
出版者:	New York :Cambridge University Press, : 2015.,
面頁冊數:	xi, 353 p. :ill. ;23 cm.
標題:	Combinatorial analysis. -
ISBN:	9781107428829

The Surprising mathematics of longest increasing subsequences /
Romik, Dan,1976-

The Surprising mathematics of longest increasing subsequences /Dan Romik. - New York :Cambridge University Press,2015. - xi, 353 p. :ill. ;23 cm. - Institute of Mathematical Statistics textbooks ;4.

Includes bibliographical references (p. 340-347) and index.

A few things you need to know --

In a surprising sequence of developments, the longest increasing subsequence problem, originally mentioned as merely a curious example in a 1961 paper, has proven to have deep connections to many seemingly unrelated branches of mathematics, such as random permutations, random matrices, Young tableaux, and the corner growth model. The detailed and playful study of these connections makes this book suitable as a starting point for a wider exploration of elegant mathematical ideas that are of interest to every mathematician and to many computer scientists, physicists, and statisticians. The specific topics covered are the Vershik-Kerov-Logan-Shepp limit shape theorem, the Baik-Deift-Johansson theorem, the Tracy-Widom distribution, and the corner growth process. This exciting body of work, encompassing important advances in probability and combinatorics over the last 40 years, is made accessible to a general graduate-level audience for the first time in a highly polished presentation.

ISBN: 9781107428829US39.99

LCCN: 2014023514Subjects--Topical Terms:

523878
Combinatorial analysis.

LC Class. No.: QA164 / .R66 2015

Dewey Class. No.: 511/.6

The Surprising mathematics of longest increasing subsequences /
LDR:02073cam a2200241 a 4500 001 1991275
003 DLC
005 20150423093922.0
008 150930s2015 nyua b 001 0 eng
010 $a 2014023514
020 $a 9781107428829 $q (pbk.) : $c US39.99
020 $a 1107428823 $q (pbk.)
020 $a 9781107075832 $q (hbk.)
020 $a 1107075831 $q (hbk.)
040 $a DLC $b eng
050 0 0 $a QA164 $b .R66 2015
082 0 0 $a 511/.6 $2 23
100 1 $a Romik, Dan, $d 1976- $3 2144385
245 1 0 $a The Surprising mathematics of longest increasing subsequences / $c Dan Romik.
260 # $a New York : $b Cambridge University Press, $c 2015.
300 $a xi, 353 p. : $b ill. ; $c 23 cm.
490 1 0 $a Institute of Mathematical Statistics textbooks ; $v 4
504 $a Includes bibliographical references (p. 340-347) and index.
505 0 # $t A few things you need to know -- $t Longest increasing subsequences in random permutations -- $t The Baik-Deift-Johansson theorem -- $t Erdîos-Szekeres permutations and square Young tableaux -- $t The corner growth process : limit shapes -- $t The corner growth process: distributional results -- $t Kingman's subadditive ergodic theorem.
520 # $a In a surprising sequence of developments, the longest increasing subsequence problem, originally mentioned as merely a curious example in a 1961 paper, has proven to have deep connections to many seemingly unrelated branches of mathematics, such as random permutations, random matrices, Young tableaux, and the corner growth model. The detailed and playful study of these connections makes this book suitable as a starting point for a wider exploration of elegant mathematical ideas that are of interest to every mathematician and to many computer scientists, physicists, and statisticians. The specific topics covered are the Vershik-Kerov-Logan-Shepp limit shape theorem, the Baik-Deift-Johansson theorem, the Tracy-Widom distribution, and the corner growth process. This exciting body of work, encompassing important advances in probability and combinatorics over the last 40 years, is made accessible to a general graduate-level audience for the first time in a highly polished presentation.
650 # 0 $a Combinatorial analysis. $3 523878
650 # 0 $a Probabilities. $3 518889