Related papers: Asymptotics for the partial fractions of the restr…
Here, we discuss QCD predictions on multiplicities in parton and dipole approaches. The most general treatment is based on the notion of the generating functions. The generating function G is defined as $G(u,y)=\sum_nu^nP_n(y)$, where $P_n$…
We investigate S^3/Z_n partition function of N = 2 supersymmetric gauge theories. A gauge theory on the orbifold has degenerate vacua specified by the holonomy. The partition function is obtained by summing up the contributions of saddle…
In this paper we obtain a series of asymptotic formulae in the sum--product phenomena over the prime field $\mathbf{F}_p$. In the proofs we use usual incidence theorems in $\mathbf{F}_p$, as well as the growth result in ${\rm SL}_2…
Let $\alpha \in (0,1)$ and irrational. We investigate the asymptotic behaviour of sequences of certain trigonometric products (Sudler products) $(P_N(\alpha))_{N\in\mathbb{N}}$ with $$P_N(\alpha) =\prod_{r=1}^N|2\sin(\pi r \alpha)|.$$ More…
We investigate the possibilities to calculate vector partition functions by means of iterated partial fraction decomposition, as suggested by Beck (2004). Particularly, for an important type of families of rational functions, we describe an…
A semiprime is a natural number which can be written as the product of two primes. The asymptotic behaviour of the function $\pi_2(x)$, the number of semiprimes less than or equal to $x$, is studied. Using a combinatorial argument,…
We prove that the generating function of partitions into $k$-th powers is strongly Gaussian in the sense of B\'aez-Duarte. Within the probabilistic framework of Khinchin families, the Hardy--Ramanujan asymptotic formula for the…
In this note we investigate mixed partitions with extra condition on the sizes of the blocks. We give a general formula and the generating function. We consider in more details a special case, determining the generating functions, some…
We study generating functions of ordinary and plane partitions coloured by the action of a finite subgroup of the corresponding special linear group. After reviewing known results for the case of ordinary partitions, we formulate a…
In this paper, we establish an asymptotic formula with an effective bound on the error term for the Andrews smallest parts function $\mathrm{spt}(n)$. We use this formula to prove recent conjectures of Chen concerning inequalities which…
Motivated by partition regularity problems of homogeneous quadratic equations, we prove multiple recurrence and convergence results for multiplicative measure preserving actions with iterates given by rational sequences involving…
We give asymptotic expansions for the moments of the $M_2$-rank generating function and for the $M_2$-rank generating function at roots of unity. For this we apply the Hardy-Ramanujan circle method extended to mock modular forms. Our…
We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…
Recently, Andrews and Ghosh Dastidar (Ramanujan J. \textbf{69}, Art. No. 26, 2026) studied two interesting functions $SOME(n)$ and $DSOME(n)$, where $SOME(n)$ is the sum of all the odd parts in the partitions of $n$ minus the sum of all…
Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…
In the quantum theory, using the notion of partial supersymmetry, in which some, but not all, operators have superpartners we derive the Euler theorem in partition theory. The paraferminic partition function gives another identity in…
We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…
Let $S(n)$ denote the least primary factor in the primary decomposition of the multiplicative group $M_n = (\Bbb Z/n\Bbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/(\log x)^{1/2}$, for the counting function of…
Random matrix products arise in many science and engineering problems. An efficient evaluation of its growth rate is of great interest to researchers in diverse fields. In the current paper, we reformulate this problem with a generating…
The functions $F_{G}(n)$ measures the asymptotic behavior of residual finiteness for a finitely generated group $G$. In previous work \cite{Pengitore_1}, the author claimed a characterization for $F_{N}(n)$ when $N$ is a finitely generated…