Publication: The crank of partitions mod 13
dc.contributor.author | Bilgici G. | |
dc.contributor.author | Bilgici, G | |
dc.date.accessioned | 2023-05-09T15:48:00Z | |
dc.date.available | 2023-05-09T15:48:00Z | |
dc.date.issued | 2013-04-01 | |
dc.date.issued | 2013.01.01 | |
dc.description.abstract | Let M(r,m,n) be the number of unrestricted partitions of n with crank congruent to r modulo m. Here the relations between the numbers M(r,13,13n+k) when 0≤r<13 are given. All of the results are proved by elementary methods. © 2012 Springer Science+Business Media, LLC. | |
dc.identifier.doi | 10.1007/s11139-012-9430-6 | |
dc.identifier.endpage | 424 | |
dc.identifier.issn | 1382-4090 | |
dc.identifier.scopus | 2-s2.0-84875369231 | |
dc.identifier.startpage | 403 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12597/12615 | |
dc.identifier.volume | 30 | |
dc.identifier.wos | WOS:000316365300006 | |
dc.relation.ispartof | Ramanujan Journal | |
dc.relation.ispartof | RAMANUJAN JOURNAL | |
dc.rights | false | |
dc.subject | Crank | Partition | Rank | |
dc.title | The crank of partitions mod 13 | |
dc.title | The crank of partitions mod 13 | |
dc.type | Article | |
dspace.entity.type | Publication | |
oaire.citation.issue | 3 | |
oaire.citation.volume | 30 | |
relation.isScopusOfPublication | b6367a4e-0284-47e2-bb35-638d05f07ba2 | |
relation.isScopusOfPublication.latestForDiscovery | b6367a4e-0284-47e2-bb35-638d05f07ba2 | |
relation.isWosOfPublication | 0e86d3f3-b4c3-40e1-9e9f-3a4bf466c2b3 | |
relation.isWosOfPublication.latestForDiscovery | 0e86d3f3-b4c3-40e1-9e9f-3a4bf466c2b3 |