We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

The combinatorics and complexity of integer sequences

00:00
playback rate
1
quality
480p
subtitles
off
playback rate
0.25
0.5
0.75
1
1.25
1.5
1.75
2
quality
480p
360p
240p
2
 Cite
 Share
 Related Material
 Download Purchase
No logo availableBanff International Research Station (BIRS) for Mathematical Innovation and Discovery
 Pak, Igor

Formal Metadata

Title
The combinatorics and complexity of integer sequences
Title of Series
Number of Parts
23
Author
License
CC Attribution - NonCommercial - NoDerivatives 4.0 International:
You are free to use, copy, distribute and transmit the work or content in unchanged form for any legal and non-commercial purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
Identifiers
Publisher
Release Date
Language

Content Metadata

Subject Area
Genre
Abstract
I will give a broad review of classes of integer sequences arising in combinatorics. Beside the more traditional asymptotic results, I will also emphasize the complexity aspects. Many examples will be presented. Some recent results will be mentioned as well.
Keywords
Lattice walks at the Interface of Algebra, Analysis and Combinatorics (17w5090)23 / 23