Partitions of bipartite numbers

Cited 2 time in webofscience Cited 3 time in scopus
  • Hit : 338
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorKim, JKko
dc.contributor.authorHahn, Sang-Geunko
dc.date.accessioned2013-03-02T21:21:20Z-
dc.date.available2013-03-02T21:21:20Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued1997-
dc.identifier.citationGRAPHS AND COMBINATORICS, v.13, no.1, pp.73 - 78-
dc.identifier.issn0911-0119-
dc.identifier.urihttp://hdl.handle.net/10203/75578-
dc.description.abstractLet 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.languageEnglish-
dc.publisherSPRINGER VERLAG-
dc.titlePartitions of bipartite numbers-
dc.typeArticle-
dc.identifier.wosidA1997WK77000007-
dc.identifier.scopusid2-s2.0-0040659586-
dc.type.rimsART-
dc.citation.volume13-
dc.citation.issue1-
dc.citation.beginningpage73-
dc.citation.endingpage78-
dc.citation.publicationnameGRAPHS AND COMBINATORICS-
dc.identifier.doi10.1007/BF01202238-
dc.contributor.localauthorHahn, Sang-Geun-
dc.contributor.nonIdAuthorKim, JK-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorpartitions-
dc.subject.keywordAuthorbipartite partitions-
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0