Related papers: Polynomials associated with Partitions: Polynomial…

Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected…

We consider two multiplicative statistics on the set of integer partitions: the norm of a partition, which is the product of its parts, and the supernorm of a partition, which is the product of the prime numbers $p_i$ indexed by its parts…

We study the asymptotic behaviour of the trace (the sum of the diagonal parts) of a plane partition of the positive integer n, assuming that this parfition is chosen uniformly at random from the set of all such partitions.

In this paper, harkening back to ideas of Hardy and Ramanujan, Mahler and de Bruijn, with the addition of more recent results on the Fibonacci Dirichlet series, we determine the asymptotic number of ways $p_F(n)$ to write an integer as the…

We study the zero set of polynomials built from partition statistics, complementing earlier work in this direction by Boyer, Goh, Parry, and others. In particular, addressing a question of Males with two of the authors, we prove asymptotics…

We study a new kind of symmetric polynomials P_n(x_1,...,x_m) of degree n in m real variables, which have arisen in the theory of numerical semigroups. We establish their basic properties and find their representation through the power sums…

The independence polynomial originates in statistical physics as the partition function of the hard-core model. The location of the complex zeros of the polynomial is related to phase transitions, and plays an important role in the design…

We deduce from the strong form of the Hardy--Ramanujan asymptotics for the partition function $p(n)$ an asymptotics for $p_{-S}(n)$, the number of partitions of $n$ that do not use parts from a finite set $S$ of positive integers. We apply…

Let $f: \mathbb{Z}_+\rightarrow \mathbb{Z}_+$ be a polynomial with the property that corresponding to every prime $p$ there exists an integer $\ell$ such that $p\nmid f(\ell)$. In this paper, we establish some equidistributed results…

We prove that the generating polynomials of partitions of an $n$-element set into non-singleton blocks, counted by the number of blocks, have real roots only and we study the asymptotic behavior of the leftmost roots. We apply this…

Let $p(z)=a_0+a_1z+a_2z^2+a_3z^3+\cdots+a_nz^n$ be a polynomial of degree $n,$ where the coefficients $a_j,$ $j \in \{0,1,2,\cdots n\},$ may be complex. We impose some restriction on the coefficients of the real part of the given polynomial…

In this paper, we consider the asymptotic properties of hook numbers of partitions in restricted classes. More specifically, we compare the frequency with which partitions into odd parts and partitions into distinct parts have hook numbers…

Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…

We investigate multiple Charlier polynomials and in particular we will use the (nearest neighbor) recurrence relation to find the asymptotic behavior of the ratio of two multiple Charlier polynomials. This result is then used to obtain the…

The partition function, $p_A(n)$, is defined to be the number of partitions of $n$ with parts in the set A, where $n$ is a positive integer and $A$ is a set of positive integers. It is well documented that: if A is a finite set with…

We study asymptotic clustering of zeros of random polynomials, and show that the expected discrepancy of roots of a polynomial of degree $n$, with not necessarily independent coefficients, decays like $\sqrt{\log n/n}$. Our proofs rely on…

In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two partitions of a…

The Dyson rank of an integer partition is the difference between its largest part and the number of parts it contains. Using Fine-Dyson symmetry, we give formulas for the number of partitions of n with rank larger than n/2, and we prove…

The aim of this note is to provoke discussion concerning arithmetic properties of function $p_{d}(n)$ counting partitions of an positive integer $n$ into $d$-th powers, where $d\geq 2$. Besides results concerning the asymptotic behavior of…

In the first part we associate a periodic sequence to a partition and study the connection the distribution of elements of uniform limit of the sequences. Then some facts of statistical independence of these limits are proved