DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, JK | ko |
dc.contributor.author | Hahn, Sang-Geun | ko |
dc.date.accessioned | 2013-03-02T21:21:20Z | - |
dc.date.available | 2013-03-02T21:21:20Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1997 | - |
dc.identifier.citation | GRAPHS AND COMBINATORICS, v.13, no.1, pp.73 - 78 | - |
dc.identifier.issn | 0911-0119 | - |
dc.identifier.uri | http://hdl.handle.net/10203/75578 | - |
dc.description.abstract | Let p(j)(m, n) be the number of partitions of (m, n) into at most j parts. We prove Landman et al.'s conjecture: for all j and n, p(j)(x, 2n - x) is a maximum when x = n. More generally we prove that for all positive integers m, n and j, p(j)(n,m) = p(j)(m, n) greater than or equal to p(j)(m - 1, n + 1) if m less than or equal to n. | - |
dc.language | English | - |
dc.publisher | SPRINGER VERLAG | - |
dc.title | Partitions of bipartite numbers | - |
dc.type | Article | - |
dc.identifier.wosid | A1997WK77000007 | - |
dc.identifier.scopusid | 2-s2.0-0040659586 | - |
dc.type.rims | ART | - |
dc.citation.volume | 13 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 73 | - |
dc.citation.endingpage | 78 | - |
dc.citation.publicationname | GRAPHS AND COMBINATORICS | - |
dc.identifier.doi | 10.1007/BF01202238 | - |
dc.contributor.localauthor | Hahn, Sang-Geun | - |
dc.contributor.nonIdAuthor | Kim, JK | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | partitions | - |
dc.subject.keywordAuthor | bipartite partitions | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.