Picture 1 of 1
![Combinatorics of Permutations [Discrete Mathematics and Its Applications] - Picture 1 of 1](https://i.ebayimg.com/images/g/0kYAAOSwaEhZHIGG/s-l500.jpg)
Gallery
Picture 1 of 1
Have one to sell?
Combinatorics of Permutations [Discrete Mathematics and Its Applications]
US $124.95
ApproximatelyAU $193.03
Condition:
Brand new
A new, unread, unused book in perfect condition with no missing or damaged pages. See the seller's listing for full details.
- Buy It NowCombinatorics of Permutations [Discrete Mathematics and Its Applications]
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Postage:
Free delivery in 2-4 days
Get it between Fri, 8 Aug and Mon, 11 Aug to 94104.
Located in: San Rafael, California, United States
Returns:
30-day returns. Buyer pays for return postage. If you use an eBay postage label, it will be deducted from your refund amount.
Payments:
Shop with confidence
Seller assumes all responsibility for this listing.
eBay item number:167216100254
Item specifics
- Condition
- ISBN
- 9781584884347
About this product
Product Identifiers
Publisher
CRC Press LLC
ISBN-10
1584884347
ISBN-13
9781584884347
eBay Product ID (ePID)
30515428
Product Key Features
Number of Pages
383 Pages
Language
English
Publication Name
Combinatorics of Permutations
Publication Year
2004
Subject
Programming / Algorithms, Operating Systems / General, Probability & Statistics / General, Combinatorics
Type
Textbook
Subject Area
Mathematics, Computers
Series
Discrete Mathematics and Its Applications Ser.
Format
Hardcover
Dimensions
Item Height
1 in
Item Weight
24.1 Oz
Item Length
6.4 in
Item Width
9.5 in
Additional Product Features
Intended Audience
Scholarly & Professional
LCCN
2004-045868
Dewey Edition
23
Reviews
"We found the author's explanations very clear, and there is an abundance of useful examples and helpful figures . . . There is a rich bibliography for those seeking more information or full proofs of cited results." - R. Gregory Taylor, in SIGACT News, October 2008 "[This book] was written by the author with love and enthusiasm for the subject and is a pleasure to read. Undergraduate and graduate students in combinatorics, as well as researchers, will find in it many interesting results and inspiring questions." - Mathematical Reviews, 2005f "The literature on permutations is as extensive as permutations are manifold. ... What was missing until now was a comprehensive up-to-date treatment to all aspects of the combinatorics of permutations. The author [of this book] has written it. ... This is the first book which gives a systematic introduction to this fascinating and active area of research. ... All the subjects are presented in a very pleasant way: developments are always well motivated, explanations are transparent and illustrated by numerous examples. At the end of each chapter the reader finds a list of exercises, with detailed solutions ... [containing] references [that] ... are excellent starting points for further research." - Zentralblatt fr Mathematik "One can easily imagine gems from this book forming the basis of a Martin Gardner-type column. ... [T]he fascinating chapters here on pattern avoidance, particularly the formulation and proof of the Stanley-Wilf and Furedi-Hajnal conjectures, make this book essential. ... The author shows himself the master expositor, always efficient while never terse, ever the clairvoyant and generous anticipator of misreadings that might trip readers. Summing Up: Essential." - CHOICE "Until now it was necessary to consult a myriad of sources, from textbooks to journal articles, in order to grasp the whole picture. Now, however, Mikls Bna has provided us with a comprehensive, engaging, and eminently readable introduction to all aspects of the combinatorics of permutations... "This book can be utilized at a variety of levels, from random samplings of the treasures therein to a comprehensive attempt to master all the material and solve all the exercises. In whatever direction the reader's tastes lead, a thorough enjoyment and appreciation of a beautiful area of combinatorics is certain to ensue." - From the Foreword by Richard Stanley "This book aims to round up any topic related to the combinatorial nature of permutations and present it between one set of covers...Throughout the book, there are frequent references to the excellent bibliography of more than two hundred research articles and books. It is clear that the author finds his topic to be full of 'serious fun.' This enthusiasm is conveyed in the conversational and engaging style of the writing...This book was written to be used in a graduate-level topics course. For that purpose it is ideally suited...Experienced researchers in combinatorics will find the book useful as a guide to the literature on permutations. For graduate students with advanced interests in any field of combinatorics, the faculty who work with these students, or the libraries that support them, this book is an excellent choice." -SIAM Review, "We found the author's explanations very clear, and there is an abundance of useful examples and helpful figures . . . There is a rich bibliography for those seeking more information or full proofs of cited results." R. Gregory Taylor, in SIGACT News, October 2008 "[This book] was written by the author with love and enthusiasm for the subject and is a pleasure to read. Undergraduate and graduate students in combinatorics, as well as researchers, will find in it many interesting results and inspiring questions." - Mathematical Reviews, 2005f "The literature on permutations is as extensive as permutations are manifold. … What was missing until now was a comprehensive up-to-date treatment to all aspects of the combinatorics of permutations. The author [of this book] has written it. … This is the first book which gives a systematic introduction to this fascinating and active area of research. … All the subjects are presented in a very pleasant way: developments are always well motivated, explanations are transparent and illustrated by numerous examples. At the end of each chapter the reader finds a list of exercises, with detailed solutions … [containing] references [that] … are excellent starting points for further research." - Zentralblatt für Mathematik "One can easily imagine gems from this book forming the basis of a Martin Gardner-type column. … [T]he fascinating chapters here on pattern avoidance, particularly the formulation and proof of the Stanley-Wilf and Furedi-Hajnal conjectures, make this book essential. … The author shows himself the master expositor, always efficient while never terse, ever the clairvoyant and generous anticipator of misreadings that might trip readers. Summing Up: Essential." - CHOICE "Until now it was necessary to consult a myriad of sources, from textbooks to journal articles, in order to grasp the whole picture. Now, however, Miklós Bóna has provided us with a comprehensive, engaging, and eminently readable introduction to all aspects of the combinatorics of permutations… "This book can be utilized at a variety of levels, from random samplings of the treasures therein to a comprehensive attempt to master all the material and solve all the exercises. In whatever direction the reader's tastes lead, a thorough enjoyment and appreciation of a beautiful area of combinatorics is certain to ensue." - From the Foreword by Richard Stanley "This book aims to round up any topic related to the combinatorial nature of permutations and present it between one set of covers…Throughout the book, there are frequent references to the excellent bibliography of more than two hundred research articles and books. It is clear that the author finds his topic to be full of 'serious fun.' This enthusiasm is conveyed in the conversational and engaging style of the writing…This book was written to be used in a graduate-level topics course. For that purpose it is ideally suited…Experienced researchers in combinatorics will find the book useful as a guide to the literature on permutations. For graduate students with advanced interests in any field of combinatorics, the faculty who work with these students, or the libraries that support them, this book is an excellent choice." -SIAM Review
Illustrated
Yes
Dewey Decimal
511
Table Of Content
IN ONE LINE AND CLOSE. PERMUTATIONS AS LINEAR ORDERS. RUNS Descents Alternating Runs IN ONE LINE AND ANYWHERE. PERMUTATIONS AS LINEAR ORDERS. INVERSIONS Inversions Inversion in Permutations of Multisets IN MANY CIRCLES: PERMUTATIONS AS PRODUCTS OF CYCLES Decomposing a Permutation into Cycles Type and Stirling Numbers Cycle Decomposition versus Linear Order Permutations with Restricted Cycle Structure IN ANY WAY BUT THIS: PATTERN AVOIDANCE; THE BASICS The Notion of Pattern Avoidance Patterns of Length Three Monotone Patterns Patterns of Length Four The Proof of the Stanley-Wilf Conjecture IN THIS WAY, BUT NICELY: PATTERN AVOIDANCE; THE FOLLOW-UP Polynomial Recursions Containing a Pattern Many Times Containing a Pattern a Given Number of Times MEAN AND INSENSITIVE: RANDOM PERMUTATIONS The Probabilistic Viewpoint Expectation Variance and Standard Deviation An Application: Longest Increasing Subsequences PERMUTATIONS vs. EVERYTHING ELSE: ALGEBRAIC COMBINATORICS OF PERMUTATIONS The Robinson-Schensted-Knuth Correspondence Posets of Permutations Simplicial Complexes of Permutations GET THEM ALL: ALGORITHMS AND PERMUTATIONS Generating Permutations Stack Sorting Permutations Variations of Stack Sorting SOLUTIONS TO ODD-NUMBERED EXERCISES REFERENCES LIST OF FREQUENTLY USED NOTATIONS INDEX Each chapter also includes Exercises, Problems Plus, and Solutions to Problems Plus sections
Synopsis
WINNER of a CHOICE Outstanding Academic Title Award for 2006! As linear orders, as elements of the symmetric group, modeled by matrices, modeled by graphs...permutations are omnipresent in modern combinatorics. They are omnipresent but also multifaceted, and while several excellent books explore particular aspects of the subject, no one book has covered them all. Even the classic results are scattered in various resources. Combinatorics of Permutations offers the first comprehensive, up to date treatment of both enumerative and extremal combinatorics and looks at permutation as linear orders and as elements of the symmetric group. The author devotes two full chapters to the young but active area of pattern avoidance. He explores the quest for the Stanley-Wilf conjecture and includes the recent and spectacular Marcus-Tardos proof of this problem. He examines random permutations and Standard Young Tableaux and provides an overview of the very rich algebraic combinatorics of permutations. The final chapter takes an in-depth look at combinatorial sorting algorithms. The author's style is relaxed, entertaining, and clearly reflects his enthusiasm for the "serious fun" the subject holds. Filled with applications from a variety of fields and exercises that draw upon recent research results, this book serves equally well as a graduate-level text and a reference for combinatorics researchers., Permutations are omnipresent in modern combinatorics--omnipresent but also multifaceted. While several other books explore particular aspects of the subject, no one book has covered them all, and even the classic results are scattered in various resources. Winner of a CHOICE Outstanding Academic Title Award for 2006, Combinatorics of Permutations offers a comprehensive treatment of both enumerative and extremal combinatorics. The author's style is relaxed and clearly reflects his enthusiasm for the "serious fun" the subject holds. Filled with applications and exercises that draw upon recent results, this book serves equally well as a graduate-level text and a reference for combinatorics researchers., WINNER of a CHOICE Outstanding Academic Title Award for 2006 As linear orders, as elements of the symmetric group, modeled by matrices, modeled by graphs...permutations are omnipresent in modern combinatorics. They are omnipresent but also multifaceted, and while several excellent books explore particular aspects of the subject, no one book has covered them all. Even the classic results are scattered in various resources. Combinatorics of Permutations offers the first comprehensive, up to date treatment of both enumerative and extremal combinatorics and looks at permutation as linear orders and as elements of the symmetric group. The author devotes two full chapters to the young but active area of pattern avoidance. He explores the quest for the Stanley-Wilf conjecture and includes the recent and spectacular Marcus-Tardos proof of this problem. He examines random permutations and Standard Young Tableaux and provides an overview of the very rich algebraic combinatorics of permutations. The final chapter takes an in-depth look at combinatorial sorting algorithms. The author's style is relaxed, entertaining, and clearly reflects his enthusiasm for the "serious fun" the subject holds. Filled with applications from a variety of fields and exercises that draw upon recent research results, this book serves equally well as a graduate-level text and a reference for combinatorics researchers.
LC Classification Number
QA165.B66 2004
Item description from the seller
Seller feedback (2,684)
- n***h (860)- Feedback left by buyer.Past 6 monthsVerified purchaseGreat eBay seller. Perfect transaction. Fast shipping. Expert packing job/materials. Very reasonable shipping charges. Excellent customer service and communications. Item description was/is right on. Very pleased all the way around. Five stars for sure. THANK YOU!!Strauss: Operas (#156607876078)
- 2***o (144)- Feedback left by buyer.Past 6 monthsVerified purchaseAs described in perfect condition no damage to whole lot handled with care very good price package with bubble wrap appearance fantastic very brand new quality fantastic fantastic definently recommend ships rite away no waiting AAA+++ definently coming back thank you seller
- m***m (116)- Feedback left by buyer.Past 6 monthsVerified purchaseShipping was fast. The game was very well packaged and wrapped with a hard cardboard to protect it during shipment. Game is as described. Manual, disc and insert are flawless. Not a single scratch on the disc. It looks brand new. Very happy with my purchase. Thank you!!!!
More to explore:
- Mathematics School Workbooks Guides,
- Mathematics Dictionaries & Reference Books,
- Mathematics Adult Learning & University Books,
- Mathematics School Revised Edition,
- Mathematics Dictionaries & Reference Books in English,
- Mathematics Paperback Adult Learning & University Books,
- Mathematics School 2000-2009 Publication Year,
- Mathematics School Textbooks & Study Guides in English,
- Mathematics School 1950-1999 Publication Year,
- Mathematics Paperback 1st Edition School Textbooks & Study Guides
Seller feedback (2,684)
- n***h (860)- Feedback left by buyer.Past 6 monthsVerified purchaseGreat eBay seller. Perfect transaction. Fast shipping. Expert packing job/materials. Very reasonable shipping charges. Excellent customer service and communications. Item description was/is right on. Very pleased all the way around. Five stars for sure. THANK YOU!!Strauss: Operas (#156607876078)
- 2***o (144)- Feedback left by buyer.Past 6 monthsVerified purchaseAs described in perfect condition no damage to whole lot handled with care very good price package with bubble wrap appearance fantastic very brand new quality fantastic fantastic definently recommend ships rite away no waiting AAA+++ definently coming back thank you seller
- m***m (116)- Feedback left by buyer.Past 6 monthsVerified purchaseShipping was fast. The game was very well packaged and wrapped with a hard cardboard to protect it during shipment. Game is as described. Manual, disc and insert are flawless. Not a single scratch on the disc. It looks brand new. Very happy with my purchase. Thank you!!!!