Enumerations for Compositions and Complete Homogeneous Symmetric Polynomial
- Soumendra Bera
Abstract
We count the number of occurrences of t as the summands (i) in the compositions of a positive integer n into r parts; and (ii) in all compositions of n; and subsequently obtain other results involving compositions. The initial counting further helps to solve the enumeration problems for complete homogeneous symmetric polynomial.
- Full Text: PDF
- DOI:10.5539/jmr.v7n2p1
This work is licensed under a Creative Commons Attribution 4.0 License.
Journal Metrics
- h-index (December 2021): 22
- i10-index (December 2021): 78
- h5-index (December 2021): N/A
- h5-median (December 2021): N/A
( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )
Index
- Academic Journals Database
- ACNP
- Aerospace Database
- BASE (Bielefeld Academic Search Engine)
- Civil Engineering Abstracts
- CNKI Scholar
- COPAC
- DTU Library
- EconPapers
- Elektronische Zeitschriftenbibliothek (EZB)
- EuroPub Database
- Google Scholar
- Harvard Library
- IDEAS
- Infotrieve
- JournalTOCs
- LOCKSS
- MathGuide
- MathSciNet
- MIAR
- PKP Open Archives Harvester
- Publons
- RePEc
- ResearchGate
- Scilit
- SHERPA/RoMEO
- SocioRePEc
- Standard Periodical Directory
- Technische Informationsbibliothek (TIB)
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WorldCat
Contact
- Sophia WangEditorial Assistant
- jmr@ccsenet.org