Skip to Main Content
Combinatorics of Permutations, 2nd Edition
book

Combinatorics of Permutations, 2nd Edition

by Miklos Bona
April 2016
Intermediate to advanced content levelIntermediate to advanced
478 pages
14h 44m
English
Chapman and Hall/CRC
Content preview from Combinatorics of Permutations, 2nd Edition
5
In This Way, but Nicely. Pattern Avoidance.
Follow-Up.
5.1 Polynomial Recurrences
5.1.1 Polynomially Recursive Functions
In the previous chapter, we spent considerable time and effort to find out how
large the numbers S
n
(q) are. In this chapter, we will mostly concentrate on
how nice they are, or rather, how nice the sequence {S
n
(q)}
1n
is. By abuse
of language, we will often refer to this sequence as the sequence S
n
(q).
First, of course, we should define what we mean by “nice.” We have already
made one important definition, that of P -recursive (or polynomially recursive)
sequences in Exercise 29 of Chapter 1, but for easy reference we repeat that
definition ...
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.
Start your free trial

You might also like

Introduction to Combinatorics, 2nd Edition

Introduction to Combinatorics, 2nd Edition

Martin J. Erickson

Publisher Resources

ISBN: 9781439850527