Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Prikladnaya Diskretnaya Matematika, 2013, Number 4(22), Pages 67–72 (Mi pdm432)  
Computational Methods in Discrete Mathematics

Combinatorial numbers of the finite multiset partitions

V. V. Gotsulenko

Institute for Technical Thermal Physics, National Academy of Sciences of Ukraine, Kiev, Ukraine
Full-text PDF (469 kB)
References:
PDF
HTML
Abstract: The problem of determining the number of different partitions of any finite multiset is considered. The generating functions for these combinatorial numbers are found and some of its properties are stated.
Keywords: multiset partitions, Diophantine equations, generating functions.
Document Type: Article
UDC: 519.1
Language: Russian
Citation: V. V. Gotsulenko, “Combinatorial numbers of the finite multiset partitions”, Prikl. Diskr. Mat., 2013, no. 4(22), 67–72
Citation in format AMSBIB
\Bibitem{Got13}
\by V.~V.~Gotsulenko
\paper Combinatorial numbers of the finite multiset partitions
\jour Prikl. Diskr. Mat.
\yr 2013
\issue 4(22)
\pages 67--72
\mathnet{http://mi.mathnet.ru/pdm432}
Linking options:
  • https://www.mathnet.ru/eng/pdm432
  • https://www.mathnet.ru/eng/pdm/y2013/i4/p67
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:392
    Full-text PDF :431
    References:52
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024