dc.contributor.author | Kleitman, Daniel | en_US |
dc.coverage.temporal | Spring 2006 | en_US |
dc.date.issued | 2006-06 | |
dc.identifier | 18.304-Spring2006 | |
dc.identifier | local: 18.304 | |
dc.identifier | local: IMSCP-MD5-0f59190f6bbbe4bba8d047b6b4876075 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/100853 | |
dc.description.abstract | This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic. | en_US |
dc.language | en-US | en_US |
dc.rights.uri | Usage Restrictions: This site (c) Massachusetts Institute of Technology 2016. 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. | en_US |
dc.rights.uri | Usage Restrictions: Attribution-NonCommercial-ShareAlike 3.0 Unported | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
dc.subject | discrete math; discrete mathematics; discrete; math; mathematics; seminar; presentations; student presentations; oral; communication; stable marriage; dych; emergency; response vehicles; ambulance; game theory; congruences; color theorem; four color; cake cutting; algorithm; RSA; encryption; numberical integration; sorting; post correspondence problem; PCP; ramsey; van der waals; fibonacci; recursion; domino; tiling; towers; hanoi; pigeonhole; principle; matrix; hamming; code; hat game; juggling; zero-knowledge; proof; repeated games; lewis carroll; determinants; infinitude of primes; bridges; konigsberg; koenigsberg; time series analysis; GARCH; rational; recurrence; relations; digital; image; compression; quantum computing | en_US |
dc.subject | discrete math | en_US |
dc.subject | discrete mathematics | en_US |
dc.subject | discrete | en_US |
dc.subject | math | en_US |
dc.subject | mathematics | en_US |
dc.subject | seminar | en_US |
dc.subject | presentations | en_US |
dc.subject | student presentations | en_US |
dc.subject | oral | en_US |
dc.subject | communication | en_US |
dc.subject | stable marriage | en_US |
dc.subject | dych | en_US |
dc.subject | emergency | en_US |
dc.subject | response vehicles | en_US |
dc.subject | ambulance | en_US |
dc.subject | game theory | en_US |
dc.subject | congruences | en_US |
dc.subject | color theorem | en_US |
dc.subject | four color | en_US |
dc.subject | cake cutting | en_US |
dc.subject | algorithm | en_US |
dc.subject | RSA | en_US |
dc.subject | encryption | en_US |
dc.subject | numberical integration | en_US |
dc.subject | sorting | en_US |
dc.subject | post correspondence problem | en_US |
dc.subject | PCP | en_US |
dc.subject | ramsey | en_US |
dc.subject | van der waals | en_US |
dc.subject | fibonacci | en_US |
dc.subject | recursion | en_US |
dc.subject | domino | en_US |
dc.subject | tiling | en_US |
dc.subject | towers | en_US |
dc.subject | hanoi | en_US |
dc.subject | pigeonhole | en_US |
dc.subject | principle | en_US |
dc.subject | matrix | en_US |
dc.subject | hamming | en_US |
dc.subject | code | en_US |
dc.subject | hat game | en_US |
dc.subject | juggling | en_US |
dc.subject | zero-knowledge | en_US |
dc.subject | proof | en_US |
dc.subject | repeated games | en_US |
dc.subject | lewis carroll | en_US |
dc.subject | determinants | en_US |
dc.subject | infinitude of primes | en_US |
dc.subject | bridges | en_US |
dc.subject | konigsberg | en_US |
dc.subject | koenigsberg | en_US |
dc.subject | time series analysis | en_US |
dc.subject | GARCH | en_US |
dc.subject | rational | en_US |
dc.subject | recurrence | en_US |
dc.subject | relations | en_US |
dc.subject | digital | en_US |
dc.subject | image | en_US |
dc.subject | compression | en_US |
dc.subject | quantum computing | en_US |
dc.subject | discrete math | en_US |
dc.subject | discrete mathematics | en_US |
dc.subject | discrete | en_US |
dc.subject | math | en_US |
dc.subject | mathematics | en_US |
dc.subject | seminar | en_US |
dc.subject | presentations | en_US |
dc.subject | student presentations | en_US |
dc.subject | oral | en_US |
dc.subject | communication | en_US |
dc.subject | stable marriage | en_US |
dc.subject | dych | en_US |
dc.subject | emergency | en_US |
dc.subject | response vehicles | en_US |
dc.subject | ambulance | en_US |
dc.subject | game theory | en_US |
dc.subject | congruences | en_US |
dc.subject | color theorem | en_US |
dc.subject | four color | en_US |
dc.subject | cake cutting | en_US |
dc.subject | algorithm | en_US |
dc.subject | RSA | en_US |
dc.subject | encryption | en_US |
dc.subject | numberical integration | en_US |
dc.subject | sorting | en_US |
dc.subject | post correspondence problem | en_US |
dc.subject | PCP | en_US |
dc.subject | ramsey | en_US |
dc.subject | van der waals | en_US |
dc.subject | fibonacci | en_US |
dc.subject | recursion | en_US |
dc.subject | domino | en_US |
dc.subject | tiling | en_US |
dc.subject | towers | en_US |
dc.subject | hanoi | en_US |
dc.subject | pigeonhole | en_US |
dc.subject | principle | en_US |
dc.subject | matrix | en_US |
dc.subject | hamming | en_US |
dc.subject | code | en_US |
dc.subject | hat game | en_US |
dc.subject | juggling | en_US |
dc.subject | zero-knowledge | en_US |
dc.subject | proof | en_US |
dc.subject | repeated games | en_US |
dc.subject | lewis carroll | en_US |
dc.subject | determinants | en_US |
dc.subject | infinitude of primes | en_US |
dc.subject | bridges | en_US |
dc.subject | konigsberg | en_US |
dc.subject | koenigsberg | en_US |
dc.subject | time series analysis | en_US |
dc.subject | GARCH | en_US |
dc.subject | rational | en_US |
dc.subject | recurrence | en_US |
dc.subject | relations | en_US |
dc.subject | digital | en_US |
dc.subject | image | en_US |
dc.subject | compression | en_US |
dc.subject | quantum computing | en_US |
dc.title | 18.304 Undergraduate Seminar in Discrete Mathematics, Spring 2006 | en_US |
dc.title.alternative | Undergraduate Seminar in Discrete Mathematics | en_US |
dc.type | Learning Object | |
dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | |