Skip to Content
Combinatorics of Permutations, 2nd Edition
book

Combinatorics of Permutations, 2nd Edition

by Miklos Bona
April 2016
Intermediate to advanced
478 pages
14h 44m
English
Chapman and Hall/CRC
Content preview from Combinatorics of Permutations, 2nd Edition
Get Them All. Algorithms and Permutations. 343
6. Find a sufficient and necessary condition for a permutation to be gd-
obtainable.
7. Recall the definition of sorting by t stacks in series from Exercise 30.
Let t = 2. Characterize the set of permutations that are sortable by
this procedure. We will call these permutations two-series-sortable.
8. Find a formula for the number of permutations of length n that are
two-series-sortable.
9. Modify the sorting procedure of Exercise 11 by making it undetermin-
istic as follows. In any given step, we can either
(a) put the next element of the input into any stack S
i
, for any i [t],
or
(b) put the entire conten
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

AirBnbBlueOriginElectronic ArtsHomeDepotNasdaqRakutenTata Consultancy Services

QuotationMarkO’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
QuotationMarkI wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
QuotationMarkI’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
QuotationMarkI'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Mark W.
Embedded Software Engineer

You might also like

Theory of Computational Complexity, 2nd Edition

Theory of Computational Complexity, 2nd Edition

Ding-Zhu Du, Ker-I Ko
Combinatory Logic

Combinatory Logic

Katalin Bimbó

Publisher Resources

ISBN: 9781439850527