Alguns problemas mais elaborados em análise combinatória elementar, II: Combinatória de palavras
In the study of elementary combinatorial analysis, the principles of addition and multiplication are introduced, as well as their applications to solving counting problems involving permutations and combinations with or without repetition. However, students frequently pose variations of these problems in class which are often not addressed in widely used textbooks or undergraduate programs. In this article, which corresponds to the second part of a two-part exposition, we examine some problems involving word counting and restricted multisets using the inclusion-exclusion principle and generating functions. Motivated by the introduction of generating functions in the solution of the problems, we offer a brief review of the main concepts related to these functions, highlighting aspects that we call classic and modern. We conclude the article by mentioning some topics of potential interest for further study of combinatorial analysis at a relatively elementary level.
Authors
- J. Ricardo G. Mendonça (ORCID: https://orcid.org/0000-0002-5516-0568)
Institutions
- Universidade de São Paulo (BR)
Publication Details
- Journal
- REMAT Revista Eletrônica da Matemática
- Published
- 2026-11-06
- DOI
- https://doi.org/10.35819/remat2027v13id7968
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- article
- Field-Weighted Citation Impact
- 0.00