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

Institutions

Publication Details

Journal
REMAT Revista Eletrônica da Matemática
Published
2026-11-06
DOI
https://doi.org/10.35819/remat2026v12id7968
Primary Topic
Advanced Combinatorial Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Alguns problemas mais elaborados em análise combinatória elementar, II: Combinatória de palavras

J. Ricardo G. Mendonça
REMAT Revista Eletrônica da Matemática
Advanced Combinatorial Mathematics
article

Alguns problemas mais elaborados em análise combinatória elementar, II: Combinatória de palavras

J. Ricardo G. Mendonça
article en

Abstract

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.

REMAT Revista Eletrônica da MatemáticaVol. 12
Universidade de São Paulo (BR)
Openalex Percentile: Top 23%
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon