Related papers: On the restricted partition function via determina…

We find general solutions to the generating-function equation sum c_q^{(X)} z^q = F(z)^X, where X is a complex number and F(z) is a convergent power series with |F(0)| >0. We then use these results to derive finite expressions containing…

The main result of the paper is the Fibonacci-like property of the partition function. The partition function $p(n)$ has a property: $p(n) \leq p(n-1) + p(n-2)$. Our result shows that if we impose certain restrictions on the partition, then…

Let A=(a_(ij)) be the generic n by n circulant matrix given by a_(ij)=x_(i+j), with subscripts on x interpreted mod n. Define d(n) (resp. p(n)) to be the number of terms in the determinant (resp. permanent) of A. The function p(n) is…

For any positive integers $a$ and $b$, we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to $b$ modulo $a$. For the number of such partitions made by a…

We study the rate of growth of $p(n,S,M)$, the number of partitions of $n$ whose parts all belong to $S$ and whose multiplicities all belong to $M$, where $S$ (resp. $M$) are given infinite sets of positive (resp. nonnegative) integers. We…

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

A vector partition function is the number of ways to write a vector as a non-negative integer-coefficient sum of the elements of a finite set of vectors $\Delta$. We present a new algorithm for computing closed-form formulas for vector…

The Frobenius number of relatively prime positive integers $a_1, \ldots, a_n$ is the largest integer that is not a nononegative integer combination of the $a_i.$ Given positive integers $a_1, \ldots, a_n$ with $n \ge 2,$ the set of…

Let $E_0,\ldots,E_n$ be a partition of the set of prime numbers, and define $E_j(x) := \sum_{p \in E_j \atop p \leq x} \frac{1}{p}$. Define $\pi(x;\mathbf{E},\mathbf{k})$ to be the number of integers $n \leq x$ with $k_j$ prime factors in…

Recently, Andrews introduced separable integer partition classes and studied some well-known theorems. In this article, we will consider the types of partitions with restrictions on consecutive parts. We will show that such partitions are…

We give an alternative method to that of Hardy-Ramanujan-Rademacher to derive the leading exponential term in the asymptotic approximation to the partition function p(n,a), defined as the number of decompositions of a positive integer 'n'…

Given a partition $\{E_0,\ldots,E_n\}$ of the set of primes and a vector $\mathbf{k} \in \mathbb{N}_0^{n+1}$, we compute an asymptotic formula for the quantity $|\{m \leq x: \omega_{E_j}(m) = k_j \ \forall \ 0 \leq j \leq n\}|$ uniformly in…

Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of…

For a polynomial $F(t,A_1,\ldots,A_n)\in\mathbf{F}_p[t,A_1,\ldots,A_n]$ ($p$ being a prime number) we study the factorization statistics of its specializations $$F(t,a_1,\ldots,a_n)\in\mathbf{F}_p[t]$$ with $(a_1,\ldots,a_n)\in S$, where…

In binary polynomial optimization, the goal is to find a binary point maximizing a given polynomial function. In this paper, we propose a novel way of formulating this general optimization problem, which we call factorized binary polynomial…

The number partitioning problem consists of partitioning a sequence of positive numbers ${a_1,a_2,..., a_N}$ into two disjoint sets, ${\cal A}$ and ${\cal B}$, such that the absolute value of the difference of the sums of $a_j$ over the two…

We study the properties of the product, which runs over the primes, $$\mathfrak{p}_n = \prod_{s_p(n) \, \geq \, p} p \quad (n \geq 1),$$ where $s_p(n)$ denotes the sum of the base-$p$ digits of $n$. One important property is the fact that…

The multi-variable Schmidt polynomials are defined by $$ S_n^{(r)}(x_0,\ldots,x_n):=\sum_{k=0}^n {n+k \choose 2k}^{r}{2k\choose k} x_k. $$ We prove that, for any positive integers $m$, $n$, $r$, and $\varepsilon=\pm 1$, all the coefficients…

Let $\alpha\in]0,1]$ and let $Q_j$ $(1\leqslant j\leqslant r)$ denote distinct irreducible polynomials with integer coefficients. We show that, for vectors with coordinates not exceeding a constant multiple of their mean, the joint local…

Let $P_{r}$ denote an integer with at most $r$ prime factors counted with multiplicity. In this paper we prove that for some $\lambda < \frac{1}{12}$, the inequality $\{\sqrt{p}\}<p^{-\lambda}$ has infinitely many solutions in primes $p$…