| dc.creator |
Gottlieb, Eric |
|
| dc.date |
2013-03-08T16:50:56Z |
|
| dc.date |
2013-03-08T16:50:56Z |
|
| dc.date |
2011-08-24 |
|
| dc.date.accessioned |
2023-02-20T15:07:07Z |
|
| dc.date.available |
2023-02-20T15:07:07Z |
|
| dc.identifier |
http://hdl.handle.net/10267/15801 |
|
| dc.identifier.uri |
http://localhost:8080/xmlui/handle/CUHPOERS/251095 |
|
| dc.description |
This syllabus was submitted to the Office of Academic Affairs by the course instructor. Uploaded by Archives RSA Josephine Hill. |
|
| dc.description |
Combinatorics is the study of sets, usually but not always finite, endowed with some kind of structure. For example, an ordering of the numbers 1 through n is the set of permutations. This set can be endowed with the algebraic structure of a group or the combinatorial structure of a partially ordered set. There are also natural ways to view the set of permutations as a graph. |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.publisher |
Memphis, Tenn. : Rhodes College |
|
| dc.relation |
Syllabi CRN;12402 |
|
| dc.rights |
Rhodes College owns the rights to the archival digital objects in this collection. Objects are made available for educational use only and may not be used for any non-educational or commercial purpose. Approved educational uses include private research and scholarship, teaching, and student projects. For additional information please contact archives@rhodes.edu. Fees may apply. |
|
| dc.subject |
Syllabus |
|
| dc.subject |
Curriculum |
|
| dc.subject |
Academic departments |
|
| dc.subject |
Text |
|
| dc.subject |
Mathematics and Computer Science, Department of |
|
| dc.subject |
2011 Fall |
|
| dc.title |
MATH 482-01, Combinatorics, Fall 2011 |
|
| dc.type |
Syllabus |
|