Algorithmic approach to counting of certain types \(m\)-ary partitions. (Q1420584): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congruence properties of the \(m\)-ary partition function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate estimation of the number of binary partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5631157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank

Latest revision as of 14:30, 6 June 2024

scientific article
Language Label Description Also known as
English
Algorithmic approach to counting of certain types \(m\)-ary partitions.
scientific article

    Statements

    Algorithmic approach to counting of certain types \(m\)-ary partitions. (English)
    0 references
    0 references
    2 February 2004
    0 references
    0 references
    \(m\)-ary partition algorithm
    0 references
    Recurrence table
    0 references
    Algebraic and combinatorial properties
    0 references
    Full \(m\)-ary tree
    0 references
    Boolean cube partition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references