New upper bounds for the number of partitions into a given number of parts (Q403299): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jnt.2014.03.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022791017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Partitions of the Integer N into M Nonzero Positive Integers / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:48, 8 July 2024

scientific article
Language Label Description Also known as
English
New upper bounds for the number of partitions into a given number of parts
scientific article

    Statements

    New upper bounds for the number of partitions into a given number of parts (English)
    0 references
    0 references
    29 August 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    binomial coefficients
    0 references
    multinomial coefficients
    0 references
    integer partitions
    0 references
    0 references