ID: 2008.09984

On Colored Factorizations

August 23, 2020

View on ArXiv
Jacob Sprittulla
Mathematics
Combinatorics

We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and non-distinct factorizations with at most and exactly l colors.

Similar papers 1

Unordered Factorizations with $k$ Parts

July 17, 2019

87% Match
Jacob Sprittulla
Combinatorics

We derive new formulas for the number of unordered (distinct) factorizations with $k$ parts of a positive integer $n$ as sums over the partitions of $k$ and an auxiliary function, the number of partitions of the prime exponents of $n$, where the parts have a specific number of colors. As a consequence, some new relations between partitions, Bell numbers and Stirling number of the second kind are derived. We also derive a recursive formula for the number of unordered factoriza...

Find SimilarView on arXiv

Ordered Factorizations with $k$ Factors

October 16, 2016

87% Match
Jacob Sprittulla
Combinatorics

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative sum $F_k(x,l)=\sum\nolimits_{n\leq x} f_k(n,l)$ is a polynomial in $\lfloor \log_l x \rfloor$ and give explicit expressions for the degree and the coefficients of this polynomial. An average order of the number of ordered factorizations for...

Find SimilarView on arXiv

Counting number of factorizations of a natural number

November 21, 2008

86% Match
Shamik Ghosh
Discrete Mathematics
Number Theory

In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.

Find SimilarView on arXiv

Some results on ordered and unordered factorization of a positive integers

December 1, 2014

85% Match
Daniel Yaqubi, Madjid Mirzavaziri
Combinatorics

As a well-known enumerative problem, the number of solutions of the equation $m=m_1+...+m_k$ with $m_1\leqslant...\leqslant m_k$ in positive integers is $\Pi(m,k)=\sum_{i=0}^k\Pi(m-k,i)$ and $\Pi$ is called the additive partition function. In this paper, we give a recursive formula for the so-called multiplicative partition function $\mu_1(m,k):=$ the number of solutions of the equation $m=m_1... m_k$ with $m_1\leqslant...\leqslant m_k$ in positive integers. In particular, us...

Find SimilarView on arXiv

A note on enumerating colored integer partitions

September 21, 2015

82% Match
Ran Pan
Combinatorics

In this short note, we give basic enumerative results on colored integer partitions.

Find SimilarView on arXiv
T. M. A. Fink
Number Theory
Combinatorics

The number of ordered factorizations and the number of recursive divisors are two related arithmetic functions that are recursively defined. But it is hard to construct explicit representations of these functions. Taking advantage of their recursive definition and a geometric interpretation, we derive three closed-form expressions for them both. These expressions shed light on the structure of these functions and their number-theoretic properties. Surprisingly, both functions...

Elementary formulas for integer partitions

April 27, 2010

81% Match
Mohamed El Bachraoui
Number Theory

In this note we will give various exact formulas for functions on integer partitions including the functions $p(n)$ and $p(n,k)$ of the number of partitions of $n$ and the number of such partitions into exactly $k$ parts respectively. For instance, we shall prove that $$ p(n) = \sum_{d|n} \sum_{k=1}^{d} \sum_{i_0 =1}^{\lfloor d/k \rfloor} \sum_{i_1 =i_0}^{\lfloor\frac{d- i_0}{k-1} \rfloor} \sum_{i_2 =i_1}^{\lfloor\frac{d- i_0 - i_1}{k-2} \rfloor} ... \sum_{i_{k-3}=i_{k-4}}^{\...

Find SimilarView on arXiv

A note on the exact formulas for certain $2$-color partitions

April 3, 2024

80% Match
Russelle Guadalupe
Combinatorics
Number Theory

Let $p\leq 23$ be a prime and $a_p(n)$ count the number of partitions of $n$ using two colors where one of the colors only has parts divisible by $p$. Using a result of Sussman, we derive the exact formula for $a_p(n)$ and obtain an asymptotic formula for $\log a_p(n)$. Our results partially extend the work of Mauth, who proved the asymptotic formula for $\log a_2(n)$ conjectured by Banerjee et al.

Find SimilarView on arXiv

A formula for the $r$-coloured partition function in terms of the sum of divisors function and its inverse

August 5, 2020

80% Match
Sumit Kumar Jha
General Mathematics

Let $p_{-r}(n)$ denote the $r$-coloured partition function, and $\sigma(n)=\sum_{d|n}d$ denote the sum of positive divisors of $n$. The aim of this note is to prove the following $$ p_{-r}(n)=\theta(n)+\,\sum_{k=1}^{n-1}\frac{r^{k+1}}{(k+1)!} \sum_{\alpha_1\,= k}^{n-1} \, \sum_{\alpha_2\,= k-1}^{\alpha_1-1} \cdots \sum_{\alpha_k\, = 1}^{\alpha_{k-1}-1}\theta(n-\alpha_1) \theta(\alpha_1 -\alpha_2) \cdots \theta(\alpha_{k-1}-\alpha_k) \theta(\alpha_k) $$ where $\theta(n)=n^{-1}...

Find SimilarView on arXiv

Repetition in Colored Sequences of Balls

October 17, 2017

80% Match
Jeremy M. Dover
Combinatorics

In responding to a question on Math Stackexchange, the author formulated the problem of determining the number of strings of balls colored in most $n$ colors with a number $k$ of repeated colors. In this paper, we formulate the problem more formally, and solve several variations.

Find SimilarView on arXiv