Algorithmic Approach to Counting of Certain Types m-ary Partitions


Бакоев, Валентин (2004) Algorithmic Approach to Counting of Certain Types m-ary Partitions Discrete Mathematics, Vol. 275, 2004, pp.17-41. ISSN: 0012-365X; DOI: 10.1016/S0012-365X(03)00096-7 · Source: DBLP, https://www.sciencedirect.com/science/article/pii/S0012365X03000967


 Partitions of integers of the type $m^n$ as a sum of powers of $m$ and their counting is considered. Two algorithms for counting of $m$-ary partitions of sums, where each addend is $m^n$, are developed. On the base of these algorithms some arithmetical and combinatorial properties, and polynomial form representations of the number of such partitions are derived. An algorithm with a polynomial running time, which produces the coefficients of this polynomial and computes the number of partit...
  Студия
 $m$-ary partition algorithm, Recurrence table, Algebraic and combinatorial property, Full $m$-ary tr


Природни науки, математика и информатика

Natural sciences, mathematics and informatics

 Издадено
  4026
 Валентин Бакоев

4. Ulas M., Żmija B., On arithmetic properties of binary partition polynomials. Sept. 2019, Advances in Applied Mathematics 110:153-179, DOI: 10.1016/j.aam.2019.07.001

3. Martin Klazar, What is an answer? — remarks, results and problems on PIO formulas in combinatorial enumeration, part I, August 28, 2018. https://arxiv.org/pdf/1808.08449.pdf

2. https://math.stackexchange.com/questions/227853/number-of-superincreasing-sequences-of-natural-numbers

1. https://oeis.org/A002577

Научният архив поддържа инициативата за отворен достъп OAI 2.0 с начален адрес: http://da.uni-vt.bg/oai2/