東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Algorithms for permutation statistics.

Baxter, Andrew Michael.

FindBook

Google Book

Amazon

博客來

Algorithms for permutation statistics.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Algorithms for permutation statistics./
作者:	Baxter, Andrew Michael.
面頁冊數:	170 p.
附註:	Source: Dissertation Abstracts International, Volume: 72-12, Section: B, page: 7394.
Contained By:	Dissertation Abstracts International72-12B.
標題:	Mathematics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3474861
ISBN:	9781124920498

Algorithms for permutation statistics.
Baxter, Andrew Michael.

Algorithms for permutation statistics. - 170 p.

Source: Dissertation Abstracts International, Volume: 72-12, Section: B, page: 7394.

Thesis (Ph.D.)--Rutgers The State University of New Jersey - New Brunswick, 2011.

Two sequences u; v of n positive integers are order isomorphic if their terms are in the same relative order. A permutation p said to contain permutation q as a pattern if there is some subsequence of p which is order isomorphic to q. This subsequence is called a copy of q. This notion of pattern containment is generalized to include adjacency restrictions as per dashed patterns. The primary permutation statistics studied in this work are written in terms of the number of copies of a given pattern or patterns. The central concern of this thesis is to compute answers to problems of the following type: Given patterns q_1, q_2, ..., q_t and nonnegative numbers k_1, k_2, ..., k_t how many permutations in Sn have k_i copies of q_i for each i?" The techniques which apply will depend on the nature of the patterns (i), as well as whether or not all k_i = 0.

ISBN: 9781124920498Subjects--Topical Terms:

515831
Mathematics.

Algorithms for permutation statistics.
LDR:01764nam a2200289 4500 001 1965350
005 20141022133320.5
008 150210s2011 ||||||||||||||||| ||eng d
020 $a 9781124920498
035 $a (MiAaPQ)AAI3474861
035 $a AAI3474861
040 $a MiAaPQ $c MiAaPQ
100 1 $a Baxter, Andrew Michael. $3 2101994
245 1 0 $a Algorithms for permutation statistics.
300 $a 170 p.
500 $a Source: Dissertation Abstracts International, Volume: 72-12, Section: B, page: 7394.
500 $a Adviser: Doron Zeilberger.
502 $a Thesis (Ph.D.)--Rutgers The State University of New Jersey - New Brunswick, 2011.
520 $a Two sequences u; v of n positive integers are order isomorphic if their terms are in the same relative order. A permutation p said to contain permutation q as a pattern if there is some subsequence of p which is order isomorphic to q. This subsequence is called a copy of q. This notion of pattern containment is generalized to include adjacency restrictions as per dashed patterns. The primary permutation statistics studied in this work are written in terms of the number of copies of a given pattern or patterns. The central concern of this thesis is to compute answers to problems of the following type: Given patterns q_1, q_2, ..., q_t and nonnegative numbers k_1, k_2, ..., k_t how many permutations in Sn have k_i copies of q_i for each i?" The techniques which apply will depend on the nature of the patterns (i), as well as whether or not all k_i = 0.
590 $a School code: 0190.
650 4 $a Mathematics. $3 515831
650 4 $a Computer Science. $3 626642
650 4 $a Theoretical Mathematics. $3 1672766
690 $a 0405
690 $a 0984
690 $a 0642
710 2 $a Rutgers The State University of New Jersey - New Brunswick. $b Graduate School - New Brunswick. $3 1019196
773 0 $t Dissertation Abstracts International $g 72-12B.
790 $a 0190
791 $a Ph.D.
792 $a 2011
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3474861