18.314 Combinatorial Analysis, Fall 2005

Author(s)
Postnikov, Alexander
Thumbnail
Download18-314-fall-2005/contents/index.htm (32.99Kb)
Alternative title
Combinatorial Analysis
Terms of use
Usage Restrictions: This site (c) Massachusetts Institute of Technology 2015. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license") unless otherwise noted. The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions. Usage Restrictions: Attribution-NonCommercial-ShareAlike 3.0 Unported http://creativecommons.org/licenses/by-nc-sa/3.0/
Metadata
Show full item record
Abstract
This course analyzes combinatorial problems and methods for their solution. Prior experience with abstraction and proofs is helpful. Topics include: Enumeration, generating functions, recurrence relations, construction of bijections, introduction to graph theory, network algorithms and, extremal combinatorics.
Date issued
2005-12
URI
http://hdl.handle.net/1721.1/96864
Department
Massachusetts Institute of Technology. Department of Mathematics
Other identifiers
18.314-Fall2005
local: 18.314
local: IMSCP-MD5-935c9435f3cc7c3adae949a304089f22
Keywords
Combinatorial problems methods solution, Enumeration, generating functions, recurrence relations, construction of bijections, Introduction to graph theory, Network algorithms, extremal combinatorics, Enumeration, generating functions, Enumeration, generating functions
Collections