| dc.contributor.author | Sagan, Bruce Eli. | en_US |
| dc.date.accessioned | 2024-04-30T23:55:58Z | |
| dc.date.available | 2024-04-30T23:55:58Z | |
| dc.date.copyright | 1979 | en_US |
| dc.date.issued | 1979 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1721.1/154325 | |
| dc.description | Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 1979 | en_US |
| dc.description | Vita. | en_US |
| dc.description | Bibliography: leaves 96-98. | en_US |
| dc.format.extent | 99 leaves | en_US |
| dc.publisher | Massachusetts Institute of Technology | en_US |
| dc.relation.ispartofseries | Massachusetts Institute of Technology.
Department of Mathematics. | en_US |
| dc.rights | MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided. | en_US |
| dc.rights.uri | http://dspace.mit.edu/handle/1721.1/7582 | en_US |
| dc.subject | Mathematics | en_US |
| dc.subject.lcsh | Set theory. | en_US |
| dc.subject.lcsh | Combinatorial analysis. | en_US |
| dc.subject.lcsh | Partitions (Mathematics) | en_US |
| dc.subject.lcsh | Algorithms. | en_US |
| dc.subject.other | Algorithms. fast | en_US |
| dc.subject.other | Partitions (Mathematics) fast | en_US |
| dc.subject.other | Combinatorial analysis. fast | en_US |
| dc.subject.other | Set theory. fast | en_US |
| dc.title | Partially ordered sets with hooklengths : an algorithmic approach. | en_US |
| dc.type | Thesis | en_US |
| dc.description.degree | Ph. D. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
| dc.identifier.oclc | 07117617 | en_US |
| dc.description.collection | Ph. D. Massachusetts Institute of Technology, Department of Mathematics | en_US |
| dspace.imported | 2024-04-30T23:55:58Z | en_US |
| mit.thesis.degree | Doctoral | en_US |
