Strict Partitions of Maximal Projective Degree

dc.creatorBernstein, Dan
dc.date2007-05-28
dc.date.accessioned2026-07-07T08:03:23Z
dc.date.available2026-07-07T08:03:23Z
dc.descriptionThe projective degrees of strict partitions of n were computed for all n < 101 and the partitions with maximal projective degree were found for each n. It was observed that maximizing partitions for successive values of n "lie close to each other" in a certain sense. Conjecturing that this holds for larger values of n, the partitions of maximal degree were computed for all n < 221. The results are consistent with a recent conjecture on the limiting shape of the strict partition of maximal projective degree.
dc.identifierhttps://arxiv.org/abs/0705.4015
dc.identifierhttp://arxiv.org/abs/0705.4015
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/129563
dc.subjectCombinatorics
dc.subject05A17
dc.titleStrict Partitions of Maximal Projective Degree
dc.typetext

Files

Collections