Related papers: Partitions into semiprimes
Asymptotic formulas of the number of various partitions are studied, like 3-colored partitions, concave partitions, certain plane partitions, partitions without small parts, the number of p-rings.
Following Cayley, MacMahon, and Sylvester, define a non-unitary partition to be an integer partition with no part equal to one, and let $\nu(n)$ denote the number of non-unitary partitions of size $n$. In a 2021 paper, the sixth author…
We obtain an asymptotic expansion for $p(n)$, the number of partitions of a natural number $n$, starting from a formula that relates its generating function $f(t), t\in (0,1)$ with the characteristic functions of a family of sums of…
The study of the well-known partition function $p(n)$ counting the number of solutions to $n = a_{1} + \dots + a_{\ell}$ with integers $1 \leq a_{1} \leq \dots \leq a_{\ell}$ has a long history in combinatorics. In this paper, we study a…
For $n \in \mathbb{N}$ let $\Pi[n]$ denote the set of partitions of $n$, i.e., the set of positive integer tuples $(x_1,x_2,\ldots,x_k)$ such that $x_1 \geq x_2 \geq \cdots \geq x_k$ and $x_1 + x_2 + \cdots + x_k = n$. Fixing…
We obtain an asymptotic upper bound for the product of the $p$-parts of the orders of certain composition factors of a finite group acting completely reducibly and faithfully on a finite vector space of order divisible by a prime $p$. An…
A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…
We study a two-parameter generalization of the Catalan numbers: $C_{d,p}(n)$ is the number of ways to subdivide the $d$-dimensional hypercube into $n$ rectangular blocks using orthogonal partitions of fixed arity $p$. Bremner \& Dotsenko…
Consideration of a classification of the number of partitions of a natural number according to the members of sub-partitions differing from unity leads to a non-recursive formula for the number of irreducible representations of the…
We derive semiclassical asymptotics for the orthogonal polynomials P_n(z) on the line with respect to the exponential weight \exp(-NV(z)), where V(z) is a double-well quartic polynomial, in the limit when n, N \to \infty. We assume that…
We describe the asymptotic behavior of weighted factorization lengths on numerical semigroups. Our approach is geometric as opposed to analytic, explains the presence of Curry-Schoenberg B-splines as limiting distributions, and provides…
We use the Circle Method to derive asymptotic formulas for functions related to the number of parts of partitions in particular residue classes.
We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…
For $ k \in \mathbb{N}$ we introduce an idempotent subalgebra, the spherical partition algebra ${\mathcal{SP} }_{k}$, of the partition algebra ${\mathcal{P} }_{k}$, that we define using an embedding associated with the trivial…
Improving upon previous work on the subject, we use Wright's Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer that are in any given arithmetic progression.
We define the twofold semidirect product of two skew left braces, in which both the additive and multiplicative groups are semidirect products of the corresponding groups of the given skew left braces. We consider an odd prime $p$ and an…
Let $\mathcal{T}$ be a rooted and weighted tree, where the weight of any node is equal to the sum of the weights of its children. The popular Treemap algorithm visualizes such a tree as a hierarchical partition of a square into rectangles,…
We study the distribution of partition parts in arithmetic progressions and find asymptotic results that capture all exponentially growing terms. This is accomplished by studying the behavior of non-modular Eisenstein series that appear in…
The Hardy-Ramanujan partition function asymptotics is a famous result in the asymptotics of combinatorial sequences. It was originally derived using complex analysis and number-theoretic ideas by Hardy and Ramanujan. It was later re-derived…
The Hardy-Littlewood method is a well-known technique in analytic number theory. Among its spectacular applications are Vinogradov's 1937 result that every sufficiently large odd number is a sum of three primes, and a related result of…