Durfee polynomials
From MaRDI portal
Let \(F(n)\) be a family of partitions of \(n\), and let \(F(n,d)\) denote the set of partitions in \(F(n)\) with Durfee square of size \(d\). This paper investigates the sequences \(\{F(n,d)\}\) for fixed \(n\), by examining polynomials having \(F(n,d)\) as the coefficients. The work of the paper is motivated by empirical evidence which suggests that for several families \(F\), all roots of the Durfee polynomial are real. Such a result implies that the corresponding sequence of coefficients \(\{| F(n,d)|\}\) is log-concave and unimodular.
Recommendations
Cited in
(8)- On the size of the Durfee square of a random integer partition
- Saxl conjecture for triple hooks
- From recursions to asymptotics: Durfee and dilogarithmic deductions
- On the maximal multiplicity of parts in a random integer partition
- Stable multivariate Eulerian polynomials and generalized Stirling permutations
- Durfee square areas and associated partition identities.
- Asymptotic inequalities for positive crank and rank moments
- Asymptotics of some Plancherel averages via polynomiality results
This page was built for publication: Durfee polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389776)