1. Rhodes College Digital Archives - DLynx
  2. Academics
  3. Course Syllabi
Please use this identifier to cite or link to this item: http://hdl.handle.net/10267/15801
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGottlieb, Eric-
dc.date.accessioned2013-03-08T16:50:56Z-
dc.date.available2013-03-08T16:50:56Z-
dc.date.issued2011-08-24-
dc.identifier.urihttp://hdl.handle.net/10267/15801-
dc.descriptionThis syllabus was submitted to the Office of Academic Affairs by the course instructor. Uploaded by Archives RSA Josephine Hill.en_US
dc.description.abstractCombinatorics 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.en_US
dc.language.isoen_USen_US
dc.publisherMemphis, Tenn. : Rhodes Collegeen_US
dc.relation.ispartofseriesSyllabi CRN;12402-
dc.rightsRhodes 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.subjectSyllabusen_US
dc.subjectCurriculumen_US
dc.subjectAcademic departmentsen_US
dc.subjectTexten_US
dc.subjectMathematics and Computer Science, Department ofen_US
dc.subject2011 Fallen_US
dc.titleMATH 482-01, Combinatorics, Fall 2011en_US
dc.typeSyllabusen_US
Appears in Collections:Course Syllabi

Files in This Item:
File Description SizeFormat 
2011_Fall_Math_482-01_12402.pdf229.62 kBAdobe PDFThumbnail
View/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.