Augustine O. Munagi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Augustine O. Munagi has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Toufik Mansour
University of Haifa
8 shared publications - Arnold Knopfmacher
The John Knopfmacher Centre for Applicable Analysis and Number Theory, School of Mathematics, University of the Witwatersrand, Private Bag 3, Wits 2050, Johannesburg, South Africa
6 shared publications - Abdulaziz Mohammed Alanazi
Department of Mathematics, Faculty of Sciences, University of Tabuk, Tabuk, Saudi Arabia
5 shared publications - Darlison Nyirenda
The John Knopfmacher Centre for Applicable Analysis and Number Theory, University of the Witwatersrand, Johannesburg, South Africa
3 shared publications - William J. Keith
Department of Mathematical Sciences, Michigan Technological University, Houghton, USA
3 shared publications - Florian Luca
Mathematics Division, Stellenbosch University, Stellenbosch, South Africa
2 shared publications
Latest Publications
- Open Access
Conjugation of Colored Compositions
An n-color composition is a colored composition in which a part of size m may come in m colors. This paper gives a new set of n-color-type compositions that admits exhaustive conjugation of its members. Previous attempts at conjugation of n-color compositions have yielded partial results at best. Instead of importing the coloring scheme previously used for partitions, we apply colors directly to the parts of compositions while treating any maximal string of ones as a single part under color assignment. This leads to the definition of n-color compositions of the second kind. As with ordinary compositions, a conjugate may be found using equivalent techniques: symbolic algebra, zig-zag graphs, and line graphs. We conclude with a derivation of the relevant enumeration formulas.
Open AccessConjugation of Colored Compositions
An n-color composition is a colored composition in which a part of size m may come in m colors. This paper gives a new set of n-color-type compositions that admits exhaustive conjugation of its members. Previous attempts at conjugation of n-color compositions have yielded partial results at best. Instead of importing the coloring scheme previously used for partitions, we apply colors directly to the parts of compositions while treating any maximal string of ones as a single part under color assignment. This leads to the definition of n-color compositions of the second kind. As with ordinary compositions, a conjugate may be found using equivalent techniques: symbolic algebra, zig-zag graphs, and line graphs. We conclude with a derivation of the relevant enumeration formulas.
- Open Access
- 23 December 2025
- Published by MDPI AG in Preprints.org
Conjugation of Colored Compositions
An $n$-color composition is a colored composition in which a part of size $m$ may come in $m$ colors. This paper gives a new set of $n$-color-type compositions that admits exhaustive conjugation of its members. Previous attempts at conjugation of $n$-color compositions have yielded partial results at best. Instead of importing the coloring scheme previously used for partitions, we apply colors directly to the parts of compositions while treating any maximal string of 1's as a single part under color assignment. This leads to the definition of $n$-color compositions of the second kind. As with ordinary compositions a conjugate may be found by the equivalent techniques of symbolic algebra, zig-zag graph and line graph. We conclude with a derivation of the relevant enumeration formulas.- 23 December 2025
- Published by MDPI AG in Preprints.org
Open AccessConjugation of Colored Compositions
An $n$-color composition is a colored composition in which a part of size $m$ may come in $m$ colors. This paper gives a new set of $n$-color-type compositions that admits exhaustive conjugation of its members. Previous attempts at conjugation of $n$-color compositions have yielded partial results at best. Instead of importing the coloring scheme previously used for partitions, we apply colors directly to the parts of compositions while treating any maximal string of 1's as a single part under color assignment. This leads to the definition of $n$-color compositions of the second kind. As with ordinary compositions a conjugate may be found by the equivalent techniques of symbolic algebra, zig-zag graph and line graph. We conclude with a derivation of the relevant enumeration formulas. - Open Access
Perfect Overpartitions and Factorization of Integers
In his classic text, \emph{Combinatory Analysis}, MacMahon defined a perfect partition of a positive integer $n$ as a partition whose parts contain exactly one partition of every positive integer not exceeding $n$. In this paper we apply the same definition to overpartitions which are integer partitions with the additional property that the final occurrence of each part may be overlined. It turns out that perfect overpartitions are enumerated by ordered factorization functions in which the occurrence of 2 as a factor determines the presence of an overlined part.Open AccessPerfect Overpartitions and Factorization of Integers
In his classic text, \emph{Combinatory Analysis}, MacMahon defined a perfect partition of a positive integer $n$ as a partition whose parts contain exactly one partition of every positive integer not exceeding $n$. In this paper we apply the same definition to overpartitions which are integer partitions with the additional property that the final occurrence of each part may be overlined. It turns out that perfect overpartitions are enumerated by ordered factorization functions in which the occurrence of 2 as a factor determines the presence of an overlined part. - Open Access
- 1 May 2025
- Published by Taylor & Francis in The Fibonacci Quarterly
- Vol. 63 (2) , 377-386
Primary Classes of n -Color Compositions
- 1 May 2025
- Published by Taylor & Francis in The Fibonacci Quarterly
- Vol. 63 (2) , 377-386
Open AccessPrimary Classes of n -Color Compositions
- Open Access
Some Properties of Overpartitions into Nonmultiples of Two Integers
We consider properties of overpartitions that are simultaneously {\ell}-regular and μ-regular, where {\ell} and μ are positive relatively prime integers. We prove a seven-way combinatorial identity related to these overpartitions. We also prove several congruence properties satisfied by this class of partitions (and a further related class) using both generating functions and modular forms with Radu's Algorithm.
Open AccessSome Properties of Overpartitions into Nonmultiples of Two Integers
We consider properties of overpartitions that are simultaneously {\ell}-regular and μ-regular, where {\ell} and μ are positive relatively prime integers. We prove a seven-way combinatorial identity related to these overpartitions. We also prove several congruence properties satisfied by this class of partitions (and a further related class) using both generating functions and modular forms with Radu's Algorithm.
- Open Access
- 23 September 2024
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 19 (3) , 68-85
Multicolor compositions and conjugation of N-color compositions
We introduce $n$-multicolor compositions which generalize the $n$-color compositions that Agarwal first defined twenty-two years ago. A summand may bear a set of many integer-valued colors which it bounds from above. We enumerate such multicolored compositions using generating functions. Then we isolate the conjugable class of multicolored compositions known as cracked compositions. A concise exposition of the conjugation of $n$-color compositions is presented in the classical tradition of Percy Alexander MacMahon (1854 - 1929). Our set of conjugable $n$-color compositions turn out to be considerably larger than previously known ones.
- 23 September 2024
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 19 (3) , 68-85
Open AccessMulticolor compositions and conjugation of N-color compositions
We introduce $n$-multicolor compositions which generalize the $n$-color compositions that Agarwal first defined twenty-two years ago. A summand may bear a set of many integer-valued colors which it bounds from above. We enumerate such multicolored compositions using generating functions. Then we isolate the conjugable class of multicolored compositions known as cracked compositions. A concise exposition of the conjugation of $n$-color compositions is presented in the classical tradition of Percy Alexander MacMahon (1854 - 1929). Our set of conjugable $n$-color compositions turn out to be considerably larger than previously known ones.
- Open Access
- 31 December 2023
- Published by Combinatorial Press in Online Journal of Analytic Combinatorics
- Vol. Issue 18, (18) , 1-12
Power compositions and semi-Pell compositions
In analogy with the semi-Fibonacci partitions studied recently by Andrews, we define semi-\( m \)-Pell compositions. We find that these are in bijection with certain weakly unimodal \( m \)-ary compositions. We give generating functions, bijective proofs, and a number of unexpected congruences for these objects. In the special case of \( m = 2 \), we have a new combinatorial interpretation of the semi-Pell sequence and connections to other objects.- 31 December 2023
- Published by Combinatorial Press in Online Journal of Analytic Combinatorics
- Vol. Issue 18, (18) , 1-12
Open AccessPower compositions and semi-Pell compositions
In analogy with the semi-Fibonacci partitions studied recently by Andrews, we define semi-\( m \)-Pell compositions. We find that these are in bijection with certain weakly unimodal \( m \)-ary compositions. We give generating functions, bijective proofs, and a number of unexpected congruences for these objects. In the special case of \( m = 2 \), we have a new combinatorial interpretation of the semi-Pell sequence and connections to other objects. - 10 November 2023
- Published by Annales Mathematicae et Informaticae - AMI in Annales Mathematicae et Informaticae
- Vol. 58, 71-82
Conjugation of overpartitions and some applications of over q-binomial coefficients
- 10 November 2023
- Published by Annales Mathematicae et Informaticae - AMI in Annales Mathematicae et Informaticae
- Vol. 58, 71-82
Conjugation of overpartitions and some applications of over q-binomial coefficients
- Open Access
An Extension of Sylvester’s Theorem on Arithmetic Progressions
Sylvester’s theorem states that every number can be decomposed into a sum of consecutive positive integers except powers of 2. In a way, this theorem characterizes the partitions of a number as a sum of consecutive integers. The first generalization we propose of the theorem characterizes the partitions of a number as a sum of arithmetic progressions with positive terms. In addition to synthesizing and rediscovering known results, the method we propose allows us to state a second generalization and characterize the partitions of a number into parts whose differences between consecutive parts form an arithmetic progression. To achieve this, we will analyze the set of divisors in arithmetics that modify the usual definition of the multiplication operation between two integers. As we will see, symmetries arise in the set of divisors based on two parameters: , being even or odd, and , congruent to 0, 1, or 2 (mod 3). This approach also leads to a unique representation result of the same nature as Sylvester’s theorem, i.e., a power of 3 cannot be represented as a sum of three or more terms of a positive integer sequence such that the differences between consecutive terms are consecutive integers.Open AccessAn Extension of Sylvester’s Theorem on Arithmetic Progressions
Sylvester’s theorem states that every number can be decomposed into a sum of consecutive positive integers except powers of 2. In a way, this theorem characterizes the partitions of a number as a sum of consecutive integers. The first generalization we propose of the theorem characterizes the partitions of a number as a sum of arithmetic progressions with positive terms. In addition to synthesizing and rediscovering known results, the method we propose allows us to state a second generalization and characterize the partitions of a number into parts whose differences between consecutive parts form an arithmetic progression. To achieve this, we will analyze the set of divisors in arithmetics that modify the usual definition of the multiplication operation between two integers. As we will see, symmetries arise in the set of divisors based on two parameters: , being even or odd, and , congruent to 0, 1, or 2 (mod 3). This approach also leads to a unique representation result of the same nature as Sylvester’s theorem, i.e., a power of 3 cannot be represented as a sum of three or more terms of a positive integer sequence such that the differences between consecutive terms are consecutive integers. - Open Access
- 29 December 2022
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 17 (2) , 96-111
Refining overpartitions by properties of non-overlined parts
We study new classes of overpartitions of numbers based on the properties of non-overlined parts. Several combinatorial identities are established by means of generating functions and bijective proofs. We show that our enumeration function satisfies a pair of infinite Ramanujantype congruences modulo 3. Lastly, by conditioning on the overlined parts of overpartitions,we give a seemingly new identity between the number of overpartitions and a certain class of ordinary partition functions. A bijective proof for this theorem also includes a partial answer to a previous request for a bijection on partitions doubly restricted by divisibility and frequency.
- 29 December 2022
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 17 (2) , 96-111
Open AccessRefining overpartitions by properties of non-overlined parts
We study new classes of overpartitions of numbers based on the properties of non-overlined parts. Several combinatorial identities are established by means of generating functions and bijective proofs. We show that our enumeration function satisfies a pair of infinite Ramanujantype congruences modulo 3. Lastly, by conditioning on the overlined parts of overpartitions,we give a seemingly new identity between the number of overpartitions and a certain class of ordinary partition functions. A bijective proof for this theorem also includes a partial answer to a previous request for a bijection on partitions doubly restricted by divisibility and frequency.